New codes are addedgit add .!

Author: =

Lab2/a.out

@@ -0,0 +1,50 @@
+#include<stdio.h>
+#include<time.h>
+int binarysearch(int A[],int n,int el);
+int binarysearch(int A[],int n,int el)
+{
+int l,u,mid,flag=0;
+l=0;
+u=n-1;
+while(l<u)
+{
+mid=(l+u)/2;
+if(el>A[mid])
+l=mid+1;
+else if (el<A[mid])
+u=mid-1;
+else
+{
+flag=1;
+break;
+}
+}
+}
+int main()
+{
+clock_t start,end;
+double t; int i,n,flag,el;
+printf("Program for Binary Search!\n");
+printf("PLease note that binary searc assumes that the array is already sorted.\n Hence please enter the array values accordingly else this program might fail.\n");
+printf("Enter the array size you want: ");
+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: ");
+scanf("%d",&el);
+printf("Performing the binary search\n");
+start=clock();
+flag=binarysearch(A,n,el);
+end=clock();
+if(flag==0)
+printf("Element does not exist in the array\n");
+else
+printf("Element exist in the array\n");
+t=(double)(end-start)/CLOCKS_PER_SEC;
+printf("Time taken by the process in seconds is : %f\n",t);
+return 0;
+}

Lab2/binarysearch.c

@@ -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;
+}

Lab2/linearsearch.c

@@ -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;
+}
+}

Lab2/merge.cpp

@@ -0,0 +1,13 @@
+#include<stdio.h>
+int main()
+{
+int a,n,i,p=1;
+printf("Enter the number whose power you want: ");
+scanf("%d",&a);
+printf("Enter the number who must be exponent: ");
+scanf("%d",&n);
+for(i=0;i<n;i++)
+p=p*a;
+printf("Exponent of %d over %d is: %d\n",a,n,p);
+return 0;
+}

a.out

@@ -0,0 +1,23 @@
+#include<stdio.h>
+int power(int a,int n)
+{
+int i,p=1;
+if(n==1)
+return p;
+else
+{
+p=p*a;
+power(a,n-1);
+}
+}
+int main()
+{
+int a,n,p;
+printf("Enter the number whose exponent you want: ");
+scanf("%d",&a);
+printf("Enter the exponent value: ");
+scanf("%d",&n);
+p=power(a,n);
+printf("The value of %d over %d is: %d\n",a,n,p);
+return 0;
+}

divideandconquerproblems/powernum/a.out

@@ -0,0 +1,15 @@
+#include<stdio.h>
+#include<time.h>
+int main()
+{
+clock_t start,end; 
+//Note that clock functions capturers current clock puls... Hence we divide by clocks per sec to get answer in seconds
+double t;
+int a;
+start=clock();
+scanf("%d",&a);
+end=clock();
+t=(double)(end-start)/CLOCKS_PER_SEC;
+printf("User took these nanoseconds: %f\n",t*1000000000);
+return 0;
+}