OOP_lab_updated

lab4_sorting/bubble_sort(lab4_2).c

@@ -0,0 +1,43 @@
+#include <stdio.h>
+#include "rdm.h"
+void sort(int*ar,int n)
+{
+    int i,j,d;
+    for(i=0;i<n-1;i++)
+    {
+        for(j=0;j<n-i-1;j++)
+        {
+           if(*(ar+j)>*(ar+j+1))
+           {
+               d=*(ar+j);
+               *(ar+j)=*(ar+j+1);
+               *(ar+j+1)=d;
+           }
+        }
+        int k;
+        printf("\npass %d\n",i);
+        for(k=0;k<n;k++)
+        {
+            printf("%d ",*(ar+k));
+        }
+    }
+}
+int main()
+{
+
+    int n,i;
+    scanf("%d",&n);
+    int ar[n];
+    rdm(ar,n);
+    printf("Orrignal array!\n");
+    for(i=0;i<n;i++)
+    {
+        printf("%d ",ar[i]);
+    }
+    sort(ar,n);
+    printf("\nSorted array!\n");
+    for(i=0;i<n;i++)
+    {
+        printf("%d ",ar[i]);
+    }
+}

lab4_sorting/insertion_sort(lab4_4).cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+#include "rdm.h"
+using namespace std;
+int main()
+{
+    int n,i,j,d;
+    cin>>n;
+    int ar[n];
+    srand(time(NULL));
+    rdm(ar,n);
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<' ';
+    }
+    cout<<endl;
+    for(i=1;i<n;i++)
+    {
+        d=ar[i];
+        j=i-1;
+        while(j>=0&&ar[j]>d)
+        {
+            ar[j+1]=ar[j];
+            j--;
+        }
+        ar[j+1]=d;
+    }
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<' ';
+    }
+    cout<<endl;
+}

lab4_sorting/lab4_1.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+#include <time.h>
+using namespace std;
+void rdm(int ar[],int n)
+{
+    int i;
+    for(i=0;i<n;i++)
+    {
+        ar[i]=rand()%(99-0+1)+0;
+    }
+}
+int main()
+{
+    int n,i;
+    cin>>n;
+    int ar[n];
+    srand(time(NULL));
+    rdm(ar,n);
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<' ';
+    }
+}

lab4_sorting/lab4_10.cpp

@@ -0,0 +1,47 @@
+#include <bits/stdc++.h>
+#include "rdm.h"
+using namespace std;
+int main()
+{
+    int n,i,j,d;
+    cout<<"Enter size of array"<<endl;
+    cin>>n;
+    int ar[n+1];
+    srand(time(NULL));
+    rdm(ar,n);
+    cout<<endl;
+    for(i=1;i<n;i++)
+    {
+        d=ar[i];
+        j=i-1;
+        while(j>=0&&ar[j]>d)
+        {
+            ar[j+1]=ar[j];
+            j--;
+        }
+        ar[j+1]=d;
+    }
+    cout<<"Sorted array is "<<endl;
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<' ';
+    }
+    cout<<endl;
+    int p;
+    cin>>p;
+    for(i=n;i>=0;i--)
+    {
+        if(ar[i]>p)
+            ar[i+1]=ar[i];
+        else
+        {
+            ar[i+1]=p;
+            break;
+        }
+    }
+    cout<<"Array after insertion of "<<p<<endl;
+    for(i=0;i<n+1;i++)
+    {
+        cout<<ar[i]<<' ';
+    }
+}

lab4_sorting/lab4_7.cpp

@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+#include "rdm.h"
+using namespace std;
+int main()
+{
+    int n,i,j,d,max_val;
+    cin>>n;
+    int ar[n];
+    srand(time(NULL));
+    rdm(ar,n);
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<' ';
+    }
+    int pos=0;
+    d=maxi(ar,n,&pos);
+    int freq[d]={0};
+    for(i=0;i<n;i++)
+    {
+        freq[ar[i]]++;
+    }
+    pos=0;
+    max_val=maxi(freq,d,&pos);
+    cout<<endl<<pos<<" it apperad "<<max_val<<" times "<<endl;
+}

lab4_sorting/lab4_8.cpp

@@ -0,0 +1,32 @@
+
+#include <bits/stdc++.h>
+#include "rdm.h"
+#include <string.h>
+using namespace std;
+int main()
+{
+    int n,i,j,d,count=0;
+    char ar[100005];
+    gets(ar);
+    n=strlen(ar);
+    //cout<<endl;
+    //puts(ar);
+    for(i=1;i<n;i++)
+    {
+        d=ar[i];
+        j=i-1;
+        while(j>=0&&ar[j]>d)
+        {
+            ar[j+1]=ar[j];
+            j--;
+            count++;
+        }
+        ar[j+1]=d;
+    }
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i];
+    }
+    cout<<"\narray sorted in "<<count<<"shifts"<<endl;
+    cout<<endl;
+}

lab4_sorting/lab4_9.cpp

@@ -0,0 +1,53 @@
+
+/*ashutosh shrimal*/
+#include <bits/stdc++.h>
+#include "rdm.h"
+#include <time.h>
+using namespace std;
+int part(int a[],int l,int r,int n)
+{
+    int j,temp,i=l;
+    for(j=l;j<r-1;j++)
+    {
+        if(a[j]<=a[r-1])
+        {
+            temp=a[j];
+            a[j]=a[i];
+            a[i]=temp;
+            i++;
+        }
+    }
+    temp=a[i];
+    a[i]=a[r-1];
+    a[r-1]=temp;
+    return i;
+}
+void qsort(int ar[],int l,int h,int n)
+{
+    int i;
+     if(l<h)
+    {
+    int piv=part(ar,l,h,n);
+  //  qsort(ar,l,piv-1,n);
+   // qsort(ar,piv+1,h,n);
+    }
+}
+int main()
+{
+    int n,i;
+    cin>>n;
+    srand(time(NULL));
+    int ar[n];
+    rdm(ar,n);
+    cout<<"array before sorting"<<endl;
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<" ";
+    }
+    qsort(ar,0,n,n);
+    cout<<"\narray after sorting"<<endl;
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<" ";
+    }
+}

lab4_sorting/merge_sort(lab4_6).cpp

@@ -0,0 +1,76 @@
+/*ashutosh shrimal*/
+#include <bits/stdc++.h>
+#include "rdm.h"
+#include <time.h>
+using namespace std;
+void mer(int ar[],int l,int mid1,int mid2,int h,int n)
+{
+int C,left,right,i,temp[n];
+C=l;
+left=l;
+right=mid2;
+while(left<=mid1&&right<=h)
+{
+    if(ar[left]<=ar[right])
+    {
+        temp[C]=ar[left];
+        left=left+1;
+    }
+    else
+    {
+        temp[C]=ar[right];
+        right=right+1;
+    }
+    C=C+1;
+}
+    if(left>mid1)
+    {
+       while(right<=h)
+       {
+           temp[C]=ar[right];
+           right=right+1;
+           C=C+1;
+       }
+    }
+    else
+    {
+        while(left<=mid1)
+        {
+          temp[C]=ar[left];
+           left=left+1;
+           C=C+1;
+        }
+    }
+    for(i=l;i<=h;i++)
+        ar[i]=temp[i];
+}
+void msort(int ar[],int l,int h,int n)
+{   //cout<<"c1 ";
+    if(l<h)
+    {
+        int mid=ceil((l+h)/2.0);
+        cout<<"mid="<<mid;
+        msort(ar,l,mid-1,n);
+        msort(ar,mid,h,n);
+        mer(ar,l,mid-1,mid,h,n);
+    }
+}
+int main()
+{
+    int n,i;
+    cout<<"Enter array size:";
+    cin>>n;
+    int ar[n];
+    rdm(ar,n);
+    cout<<"array before sorting"<<endl;
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<" ";
+    }
+    msort(ar,0,n-1,n);
+    cout<<"array after sorting"<<endl;
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<" ";
+    }
+}

lab4_sorting/quick_sort(lab4_5).cpp

@@ -0,0 +1,56 @@
+/*ashutosh shrimal*/
+#include <bits/stdc++.h>
+#include "rdm.h"
+#include <time.h>
+using namespace std;
+int part(int ar[],int l,int h,int n)
+{
+    int piv=ar[l];
+    int left,right;
+    left=l+1;
+    right=h;
+    while(left<=right)
+    {
+        while(left<=h&&ar[left]<=piv)
+        {
+            left=left+1;
+        }
+        while(ar[right]>piv)
+            right=right-1;
+        if(left<right)
+        {
+            swap(ar[left],ar[right]);
+        }
+    }
+    swap(ar[right],ar[l]);
+    return right;
+}
+void qsort(int ar[],int l,int h,int n)
+{
+    int i;
+    if(l<h)
+    {
+    int piv=part(ar,l,h,n);
+    qsort(ar,l,piv-1,n);
+    qsort(ar,piv+1,h,n);
+    }
+}
+int main()
+{
+    int n,i;
+    cin>>n;
+    srand(time(NULL));
+    int ar[n];
+    rdm(ar,n);
+    cout<<"array before sorting"<<endl;
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<" ";
+    }
+    qsort(ar,0,n-1,n);
+    cout<<"\narray after sorting"<<endl;
+    for(i=0;i<n;i++)
+    {
+        cout<<ar[i]<<" ";
+    }
+}