lab/quick1.c at main · kavya852/lab · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <stdio.h>
int c= 0;
void swap(int *a,int *b )
{
    int temp =*a;
    *a= *b;
    *b = temp;
}
int partition(int a[],int start,int end)
{
    int j ;
    int pivot = a[end];
    int i =(start-1);
    for(j=start ; j<end ; j++)
    {
        if(a[j]<= pivot)
        {
            i++;
            swap(&a[i],&a[j]);
            c++;
        }
    }
    swap(&a[i+1],&a[end]);
    c++;
    return i + 1;

}
void quicksort(int a[],int start, int end)
{
    if(start < end)
    {
        int pi = partition(a,start,end);
        quicksort(a,start,pi-1);
        quicksort(a,pi+1,end);
    }
}
void printarray(int a[],int n)
{
    for(int i = 0 ; i< n ; i++)
    {
        printf("%d ",a[i]);
    }
}
int main()
{
    int size , arr[100];
    printf("enetr the size of an aray \n");
    scanf("%d",&size);
    printf("enetr the elements of the array\n");
    for(int  i = 0 ; i<size ;i++)
    {
        scanf("%d",&arr[i]);
    }
    printf("sorted array is: ");
    quicksort(arr,0,size-1);
    printarray(arr,size);
    printf("\nThe no. of iterations are : %d \n",c);
}

//(exp-4b-quicksort pivot start)

#include <stdio.h>
int c= 0;
void swap(int *a,int *b )
{
    int temp =*a;
    *a= *b;
    *b = temp;
}
int partition(int a[],int start,int end)
{
    int j ;
    int pivot = a[start];
    int i =(end+1);
    for(j=end ; j>start ; j--)
    {
        if(a[j]>= pivot)
        {
            i--;
            swap(&a[i],&a[j]);
            c++;
        }
    }
    swap(&a[i-1],&a[start]);
    c++;
    return i - 1;

}
void quicksort(int a[],int start, int end)
{
    if(start < end)
    {
        int pi = partition(a,start,end);
        quicksort(a,start,pi-1);
        quicksort(a,pi+1,end);
    }
}
void printarray(int a[],int n)
{
    for(int i = 0 ; i< n ; i++)
    {
        printf("%d ",a[i]);
    }
}
int main()
{
    int size , arr[100];
    printf("enetr the size of an aray \n");
    scanf("%d",&size);
    printf("enetr the elements of the array\n");
    for(int  i = 0 ; i<size ;i++)
    {
        scanf("%d",&arr[i]);

    }
    printf("sorted array is: ");
    quicksort(arr,0,size-1);
    printarray(arr,size);
    printf("\nThe no. of iterations arr : %d \n",c);
}