Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- ///Number 1: Merge sort Ascending Order
- #include<stdlib.h>
- #include<stdio.h>
- void merge(int arr[], int l, int m, int r)
- {
- int i, j, k;
- int n1 = m - l + 1;
- int n2 = r - m;
- int L[n1], R[n2];
- for(i = 0; i < n1; i++)
- L[i] = arr[l + i];
- for(j = 0; j < n2; j++)
- R[j] = arr[m + 1+ j];
- i = 0;
- j = 0;
- k = l;
- while (i < n1 && j < n2)
- {
- if (L[i] <= R[j])
- {
- arr[k] = L[i];
- i++;
- }
- else
- {
- arr[k] = R[j];
- j++;
- }
- k++;
- }
- while (i < n1)
- {
- arr[k] = L[i];
- i++;
- k++;
- }
- while (j < n2)
- {
- arr[k] = R[j];
- j++;
- k++;
- }
- }
- void mergeSort(int arr[], int l, int r)
- {
- if (l < r)
- {
- int m = l+(r-l)/2;
- mergeSort(arr, l, m);
- mergeSort(arr, m+1, r);
- merge(arr, l, m, r);
- }
- }
- void printArray(int A[], int size)
- {
- int i;
- for (i=0; i < size; i++)
- printf("%d ", A[i]);
- printf("\n");
- }
- int main()
- {
- int arr[] = {12, 11, 13, 5, 6, 7};
- int arr_size = sizeof(arr)/sizeof(arr[0]);
- printf("Given array is \n");
- printArray(arr, arr_size);
- mergeSort(arr, 0, arr_size - 1);
- printf("\nSorted array is \n");
- printArray(arr, arr_size);
- return 0;
- }
- /// Number 2 : merge sort Descending order
- #include<stdlib.h>
- #include<stdio.h>
- void merge(int arr[], int l, int m, int r)
- {
- int i, j, k;
- int n1 = m - l + 1;
- int n2 = r - m;
- int L[n1], R[n2];
- for(i = 0; i < n1; i++)
- L[i] = arr[l + i];
- for(j = 0; j < n2; j++)
- R[j] = arr[m + 1+ j];
- i = 0;
- j = 0;
- k = l;
- while (i < n1 && j < n2)
- {
- if (L[i] >= R[j])
- {
- arr[k] = L[i];
- i++;
- }
- else
- {
- arr[k] = R[j];
- j++;
- }
- k++;
- }
- while (i < n1)
- {
- arr[k] = L[i];
- i++;
- k++;
- }
- while (j < n2)
- {
- arr[k] = R[j];
- j++;
- k++;
- }
- }
- void mergeSort(int arr[], int l, int r)
- {
- if (l < r)
- {
- int m = l+(r-l)/2;
- mergeSort(arr, l, m);
- mergeSort(arr, m+1, r);
- merge(arr, l, m, r);
- }
- }
- void printArray(int A[], int size)
- {
- int i;
- for (i=0; i < size; i++)
- printf("%d ", A[i]);
- printf("\n");
- }
- int main()
- {
- int arr[] = {12, 11, 13, 5, 6, 7};
- int arr_size = sizeof(arr)/sizeof(arr[0]);
- printf("Given array is \n");
- printArray(arr, arr_size);
- mergeSort(arr, 0, arr_size - 1);
- printf("\nSorted array is \n");
- printArray(arr, arr_size);
- return 0;
- }
- ///Number 3: Quick sort Ascending order
- #include<stdio.h>
- void swap(int* a, int* b)
- {
- int t = *a;
- *a = *b;
- *b = t;
- }
- int partition (int arr[], int l, int h)
- {
- int x = arr[h];
- int i = (l - 1);
- for (int j = l; j <= h- 1; j++)
- {
- if (arr[j] <= x)
- {
- i++;
- swap(&arr[i], &arr[j]);
- }
- }
- swap(&arr[i + 1], &arr[h]);
- return (i + 1);
- }
- void quickSort(int arr[], int l, int h)
- {
- if (l < h)
- {
- int p = partition(arr, l, h);
- quickSort(arr, l, p - 1);
- quickSort(arr, p + 1, h);
- }
- }
- void printArray(int arr[], int size)
- {
- int i;
- for (i=0; i < size; i++)
- printf("%d ", arr[i]);
- printf("\n");
- }
- int main()
- {
- int arr[] = {10, 7, 8, 9, 1, 5};
- int n = sizeof(arr)/sizeof(arr[0]);
- quickSort(arr, 0, n-1);
- printf("Sorted array: \n");
- printArray(arr, n);
- return 0;
- }
- /// Number 4 Quick sort Descending order
- #include<stdio.h>
- void swap(int* a, int* b)
- {
- int t = *a;
- *a = *b;
- *b = t;
- }
- int partition (int arr[], int l, int h)
- {
- int x = arr[h];
- int i = (l - 1);
- for (int j = l; j <= h- 1; j++)
- {
- if (arr[j] >= x)
- {
- i++;
- swap(&arr[i], &arr[j]);
- }
- }
- swap(&arr[i + 1], &arr[h]);
- return (i + 1);
- }
- void quickSort(int arr[], int l, int h)
- {
- if (l < h)
- {
- int p = partition(arr, l, h);
- quickSort(arr, l, p - 1);
- quickSort(arr, p + 1, h);
- }
- }
- void printArray(int arr[], int size)
- {
- int i;
- for (i=0; i < size; i++)
- printf("%d ", arr[i]);
- printf("\n");
- }
- int main()
- {
- int arr[] = {10, 7, 8, 9, 1, 5};
- int n = sizeof(arr)/sizeof(arr[0]);
- quickSort(arr, 0, n-1);
- printf("Sorted array: \n");
- printArray(arr, n);
- return 0;
- }
- /// Number 5 . Bubble sort Ascending order
- #include <stdio.h>
- void swap(int *xp, int *yp)
- {
- int temp = *xp;
- *xp = *yp;
- *yp = temp;
- }
- void bubbleSort(int arr[], int n)
- {
- int i, j;
- for (i = 0; i < n-1; i++)
- for (j = 0; j < n-i-1; j++)
- if (arr[j] > arr[j+1])
- swap(&arr[j], &arr[j+1]);
- }
- void printArray(int arr[], int size)
- {
- int i;
- for (i=0; i < size; i++)
- printf("%d ", arr[i]);
- printf("\n");
- }
- int main()
- {
- int arr[] = {64, 34, 25, 12, 22, 11, 90};
- int n = sizeof(arr)/sizeof(arr[0]);
- bubbleSort(arr, n);
- printf("Sorted array: \n");
- printArray(arr, n);
- return 0;
- }
- /// Number 6 Bubble sort Descending order
- #include <stdio.h>
- void swap(int *xp, int *yp)
- {
- int temp = *xp;
- *xp = *yp;
- *yp = temp;
- }
- void bubbleSort(int arr[], int n)
- {
- int i, j;
- for (i = 0; i < n-1; i++)
- for (j = 0; j < n-i-1; j++)
- if (arr[j] < arr[j+1])
- swap(&arr[j], &arr[j+1]);
- }
- void printArray(int arr[], int size)
- {
- int i;
- for (i=0; i < size; i++)
- printf("%d ", arr[i]);
- printf("\n");
- }
- int main()
- {
- int arr[] = {64, 34, 25, 12, 22, 11, 90};
- int n = sizeof(arr)/sizeof(arr[0]);
- bubbleSort(arr, n);
- printf("Sorted array: \n");
- printArray(arr, n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement