(DS-6)

6A.Write a program to implement merge sort.

#include<stdio.h>

void mergesort(int a[],int i, int j);

void merge(int a[],int i1,int j1,int i2,int j2);

int main()

{

int a[30],n,i;

  printf("Enter No of Elements : ");

  scanf("%d", &n);

  printf("Enter Array Elements : ");

 

  for(i=0;i<n;i++)

  scanf("%d", &a[i]);

 

  mergesort(a,0,n-1);

  printf("\n Sorted Array is : ");

  for(i=0;i<n;i++)

  printf("\t %d",a[i]);

return 0;

}

void mergesort(int a[],int i, int j)

{

int mid;

if(i<j)

{

mid=(i+j)/2;

mergesort(a,i,mid); 

mergesort(a,mid+1,j);  

merge(a,i,mid,mid+1,j); 

}

}

void merge(int a[],int i1,int j1,int i2,int j2)

{

int temp[50];   

int i,j,k;

i=i1;   

j=i2;  

k=0;

while(i<=j1 && j<=j2)  

{

if(a[i]<a[j])

{

temp[k++]=a[i++];

}

else

{

temp[k++]=a[j++];

}

}

while(i<=j1)

{

temp[k++]=a[i++];

}

while(j<=j2) 

{

temp[k++]=a[j++];

}

for(i=i1,j=0 ; i<=j2 ; i++,j++)

{

a[i]=temp[j];

}

}

6B.Write a program to search the element using sequential search.

#include<stdio.h>

int main()

{

int a[10],i,n,val;

printf("\nEnter no. of elements :");

scanf("%d",&n);

for(i=0 ; i<n ; i++)

{

printf("\nEnter no. at index %d :",i);

scanf("%d",&a[i]);

}

printf("\nEnter the value to be searched :");

scanf("%d",&val);

for(i=0 ; i<n ; i++)

{

if(a[i]==val)

{

printf("\n %d was found at %d index",val,i);

break;

}

}

if(i==n)

{

printf("\n %d was not found in the list !!",val);

}

return 0;

}

6C.Write a program to search the element using binary search. 

//Write a program to search the element using binary search

#include<stdio.h>

int main()

{

int a[100],i,n,val,first,last,middle;

printf("\n enter the no of element :");

scanf("%d",&n);

for(i=0;i<n;i++)

{

printf("\n enter the no of index %d :",i);

scanf("%d",&a[i]);

}


printf("\n enter the value for searching : ");

scanf("%d",&val);

first=0;

last=n-1;

middle=(first+last)/2;

while(first <= last)

{

if(a[middle] < val)

{

first=middle+1;

}

else if(a[middle] == val)

{

printf("%d is found at location %d \n ",val,middle+1);

break;

}

else

{

last=middle-1;

}

middle =(first+last)/2;

}

if(first>last)

{

printf("Not found ! %d isn't present in the list.\n ",val);

}

return 0;

} 

Comments

Post a Comment

Popular posts from this blog

python(BI)

PRACTICAL NO.1 AIM: Perform the data classification using classification algorithm.  1A. Perform the data classification using Naïve Baye’s Algorithm. from sklearn.datasets import load_iris iris = load_iris() X = iris.data y = iris.target from sklearn.model_selection import train_test_split X_train,X_test,y_train,y_test=train_test_split(X,y,test_size=0.4,random_state=1) from sklearn.naive_bayes import GaussianNB gnb=GaussianNB() gnb.fit(X_train,y_train) y_pred=gnb.predict(X_test) from sklearn import metrics print("Gaussian Naive Bayes model accuracy(in%):",metrics.accuracy_score(y_test,y_pred)*100) EXAMPLE-span.csv import numpy as np import pandas as pd from sklearn.feature_extraction.text import CountVectorizer from sklearn.naive_bayes import MultinomialNB df=pd.read_csv('/content/spam1.csv',encoding='latin-1') df=df[['Message','Category']] df.columns=['SMS','Type'] countvec=CountVectorizer(ngram_range=(1,4),stop_words='eng...
Read more

Prac_8(AMP)

PRACTICAL 8  Activity.xml <? xml version ="1.0" encoding ="utf-8" ?> <androidx.constraintlayout.widget.ConstraintLayout xmlns: android ="http://schemas.android.com/apk/res/android"     xmlns: app ="http://schemas.android.com/apk/res-auto"     xmlns: tools ="http://schemas.android.com/tools"     android :layout_width ="match_parent"     android :layout_height ="match_parent"     tools :context =".MainActivity" >    <Button         android :id ="@+id/btnstart"         android :layout_width ="wrap_content"         android :layout_height ="wrap_content"         android :text ="Start"         app :layout_constraintBottom_toBottomOf ="parent"         app :layout_constraintEnd_to...
Read more

LSA10

i) Program that demonstrates the use of if..else with test Create a vi editor to write the script: vi Prog1.sh Code: echo Enter any number read n if test $n -gt 0 then              echo $n is positive else              echo $n is negative fi steps forward chmod +X Prog1.sh bash Prog1.sh ii) Program to check existing file Create a vi editor to write the script: code: echo Enter the file name: read fname if [ -f $fname ] then           echo the File Exists. else             echo the File with name $fname does not exists fi iii) Program for string comparison Create a vi editor to write the script: code: echo Enter two Strings read str1 read str2 if [ $str1 = $str2 ] then             echo The strings are identical else             echo The Strings are not id...
Read more