(DS-5)

 5A.Write a program to implement bubble sort. 

#include<stdio.h>

int main()

{

int a[10],i,j,temp,n;

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

scanf("%d",&n);

printf("\nEnter %d integers :\n",n);

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

{

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

}

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

{

for(j=i+1 ; j<n ; j++)

{

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

{

temp=a[i];

a[i]=a[j];

a[j]=temp;

}

}

}

printf("\nBubble Sorted list in ascending order is :");

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

{

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

}

}

5B.Write a program to implement selection sort.

#include<stdio.h>

int main()

{

int a[20],n,i,j,position,t;

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

scanf("%d",&n);

printf("\nEnter %d integers :\n",n);

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

{

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

}

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

{

position=i;

for(j=i+1 ; j<n ; j++)

{

if(a[position]>a[j])

position=j;

}

if(position != i)

{

t=a[i];

a[i]=a[position];

a[position]=t;

}

}

printf("\nSelection Sorted list in ascending order is :\n");

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

{

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

}

return 0;

}

5C.Write a program to implement insertion sort.

#include<stdio.h>

int main()

{

int n,a[10],i,j,temp;

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

scanf("%d",&n);

printf("\nEnter %d integers :\n",n);

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

{

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

}

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

{

temp=a[i];

j=i-1;

while((temp<a[j]) && (j>=0))

{

a[j+1]=a[j];

j--;

}

a[j+1]=temp;

}

printf("\nInsertion sorted list in ascending order is :\n");

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

{

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

}

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