Adding basic sorting programs and content of Lab1

Author: =

Lab1/3.c

@@ -0,0 +1,45 @@
+#include<stdio.h>
+#include<time.h>
+int search(char A[],char B[],int n,int m)
+{
+int i,j,pos=-1;
+for(i=0;i<n-m;i++)
+{
+	if(A[i]==B[0])
+	{
+		j=0;
+		while(j<m && A[i+j]==B[j])
+		j=j+1;
+	}
+	if(j==m)
+	pos=i;
+}
+return pos;
+}
+int main()
+{
+int n,m,pos;
+clock_t start,end;
+double t;
+printf("Enter the respective sizes of Text and Pattern arrays such that text has more size\n");
+scanf("%d%d",&n,&m);
+if (n>=m)
+{
+char TEXT[n],PATTERN[m];
+printf("Enter the text string\n");
+scanf("%s",TEXT);
+printf("Enter the pattern string\n");
+scanf("%s",PATTERN);
+start=clock();
+pos = search(TEXT,PATTERN,n,m);
+end=clock();
+t=(double)(start-end)/CLOCKS_PER_SEC;
+printf("The element is found at %d index\n",pos);
+printf("The time taken is %f\n",t);
+}
+else
+{
+printf("The size of pattern cannot be more than text!!");
+}
+return 0;
+}

Lab1/a.out

@@ -0,0 +1,62 @@
+#include<stdio.h>
+#include<time.h>
+void bubble_sort(int A[],int n)
+{
+int i,j,temp;
+for(i=0;i<n-1;i++)
+{
+for(j=0;j<n-i-1;j++)
+{
+if(A[j]>A[j+1])
+{
+temp = A[j+1];
+A[j+1] = A[j];
+A[j] = temp;
+}
+}
+}
+}
+void selection_sort(int A[],int n)
+{
+int i,j,temp;
+for(i=0;i<n-1;i++)
+{
+for(j=i+1;j<n;j++)
+{
+if(A[j]<A[i])
+{
+temp = A[i];
+A[i] = A[j];
+A[j] = temp;
+}
+}
+}
+}
+int main()
+{
+int n,i;
+clock_t st,en;
+double t;
+printf("Enter size of the array: ");
+scanf("%d",&n);
+int A[n];
+for(i=0;i<n;i++)
+{
+printf("Enter the %d element of the array: ",i+1);
+scanf("%d",&A[i]);
+}
+int B[n];
+for(i=0;i<n;i++)
+B[i]=A[i];
+st = clock();
+bubble_sort(A,n);
+en= clock();
+t= double(en-st)/CLOCKS_PER_SEC;
+printf("Time taken for Bubble sort is :%f \n",t);
+st = clock();
+selection_sort(B,n);
+en=clock();
+t= (double)(en-st)/CLOCKS_PER_SEC;
+printf("Time taken for Selection sort is :%f \n",t);
+return 0;
+}

Lab1/bubbleandselection.cpp

@@ -0,0 +1,41 @@
+#include<stdio.h>
+#include<time.h>
+int linearsearch(int A[],int el,int n)
+{
+int i,flag=0;
+for(i=0;i<n;i++)
+{
+if(A[i]==el)
+{
+flag=1;
+break;
+}
+}
+return flag;
+}
+int main()
+{
+int n,i,el,flag;
+clock_t start,end;
+double time;
+printf("Enter the number of elements in the array: ");
+scanf("%d",&n);
+int A[n];
+for(i=0;i<n;i++)
+{
+printf("Enter the %d element of the array: ",i+1);
+scanf("%d",&A[i]);
+}
+printf("Enter the element you want to search in the array: ");
+scanf("%d",&el);
+start=clock();
+flag=linearsearch(A,el,n);
+end=clock();
+time = (double)(start-end)/CLOCKS_PER_SEC;
+if(flag==1)
+printf("The element exists in the array");
+else
+printf("The element does not exist in the array\n");
+printf("Time taken for linear search is :%f\n",time);
+return 0;
+}

Lab1/linearsearch.c

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+int n,i,j,temp;
+cout<<"Enter number of elements you want in array: ";
+cin>>n;
+int A[n];
+for(i=0;i<n;i++)
+{
+cout<<"Enter "<<i+1<<" element of the array: ";
+cin>>A[i];
+}
+cout<<"Lets sort the array by Bubble Sorting"<<endl;
+for(i=0;i<n-1;i++)
+{
+for(j=0;j<n-i-1;j++)
+{
+if(A[j]>A[j+1])
+{
+temp = A[j+1];
+A[j+1] = A[j];
+A[j] = temp;
+}
+}
+}
+cout<<"Lets see the sorted array"<<endl;
+for(i=0;i<n;i++)
+{
+cout<<i+1<<" element of the sorted array is: "<<A[i]<<endl;
+}
+}

sorting/a.out

@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+int n,i,j,key;
+cout<<"Enter size of array you want: ";
+cin>>n;
+int A[n];
+for(i=0;i<n;i++)
+{
+cout<<"Enter "<<i+1<<" element of array"<<endl;
+cin>>A[i];
+}
+cout<<"Lets do Insertion sort"<<endl;
+for(i=0;i<n;i++)
+{
+key = A[i];
+j=i-1;
+while(j>=0 && A[j]>key)
+{
+A[j+1] = A[j];
+j=j-1;
+}
+A[j+1]=key;
+}
+cout<<"Sorted Array is:"<<endl;
+for(i=0;i<n;i++)
+{
+cout<<i+1<<" Element is :"<<A[i]<<endl;
+}
+}

sorting/bubble.cpp

@@ -0,0 +1,85 @@
+#include<iostream>
+using namespace std;
+//l is lowest index and r is the max index (left and right)
+void merge(int A[],int l,int m ,int r)
+{
+//this function is to merge the partitioned arrays
+//creating temp arrays
+int n1 = m-l+1;
+int n2 = r-m;
+int A1[n1],A2[n2],i,j,k;
+//First subarray begins from l to m
+//second subarray begins from m+1 to r
+//Filling the array
+for(i=0;i<n1;i++)
+{
+A1[i] = A[l+i];
+}
+for(j=0;j<n2;j++)
+{
+A2[j] = A[m+1+j];
+}
+//Refilling the old array with correct order
+i=0; //counter for A1
+j=0;//counter for A2
+k=l;//counter for A
+while((i<n1) && (j<n2))
+{
+if (A1[i]<=A2[j])
+{
+A[k]=A1[i];
+i++;
+}
+else
+{
+A[k]=A2[j];
+j++;
+}
+k++;
+}
+//If any elements remain fill them because above while loop ends when either of the subarryas is filled
+while(i<n1)
+{
+A[k]=A1[i];
+i++;
+k++;
+}
+while(j<n2)
+{
+A[k]=A2[j];
+k++;
+j++;
+}
+}
+///////////////////////////////////////////////////////////////////
+//Main merge sort function
+void mergesort(int A[],int l,int r)
+{
+if(l<r)
+{
+int m=(l+r)/2;
+//Sorting to first and second halves
+mergesort(A,l,m);
+mergesort(A,m+1,r);
+//merging them
+merge(A,l,m,r);
+}
+}
+int main()
+{
+int n,l,r,i;
+cout<<"Enter the array size you want: ";
+cin>>n;
+int A[n];
+for(i=0;i<n;i++)
+{
+cout<<"Enter "<<i+1<<" element of the array: ";
+cin>>A[i];
+}
+cout<<"Lets do merge sorting"<<endl;
+mergesort(A,0,n-1);
+for(i=0;i<n;i++)
+{
+cout<<i+1<<" element of the array is: "<<A[i]<<endl;
+}
+}

sorting/insertion.cpp

@@ -0,0 +1,65 @@
+#include<stdio.h>
+#include<time.h>
+///////////////////////////
+void swap(int *x,int *y)
+{
+int temp;
+temp = *x;
+*x = *y;
+*y =temp;
+}
+////////////////////////////
+int partition(int A[],int low,int high)
+{
+int i,j,pivot;
+pivot = A[high];
+i=low-1;
+for(j=low;j<=high-1;j++)
+{
+if(A[j]<=pivot)
+{
+i++;
+swap(&A[i],&A[j]);
+}
+}
+swap(&A[i+1],&A[high]);
+return (i+1);
+}
+//////////////////////////////
+void quicksort(int A[],int low,int high)
+{
+int pi;
+if (low<high)
+{
+pi = partition(A,low,high);
+quicksort(A,low,pi-1);
+quicksort(A,pi+1,high);
+}
+}
+//////////////////////////
+int main()
+{
+clock_t start,end;
+double time;
+int n,i;
+printf("Enter the number of elements in the array: ");
+scanf("%d",&n);
+int A[n];
+for(i=0;i<n;i++)
+{
+printf("Enter the %d element of the array: ",i+1);
+scanf("%d",&A[i]);
+}
+printf("Lets do the quick sort of given array\n");
+start=clock();
+quicksort(A,0,n-1);
+end=clock();
+time = (double)((start-end)/CLOCKS_PER_SEC);
+printf("The sorted array is:\n");
+for(i=0;i<n;i++)
+{
+printf("The %d element of the sorted array is: %d\n",i+1,A[i]);
+}
+printf("Time taken for the quick sort is: %f\n",time);
+return 0;
+}