diff --git a/Contributors.md b/Contributors.md index cf869fb..383aa2c 100644 --- a/Contributors.md +++ b/Contributors.md @@ -1,3 +1,5 @@ # Contributors - [Mark Gormley](https://github.com/gormleymark) + +-[Rohit Agarwal](https://github.com/agarwalr98) diff --git a/sorting/bubblesort.c b/sorting/bubblesort.c new file mode 100644 index 0000000..a390771 --- /dev/null +++ b/sorting/bubblesort.c @@ -0,0 +1,38 @@ +//programme to sort elements using bubble sort algorihtm in O(n^2) worst case time. +//Bubble sort algorihtm . + +#include + +int main() +{ + int n, c, d, swap; + + printf("Enter number of elements\n"); + scanf("%d", &n); + int array[n+1]; + + printf("Enter %d integers\n", n); + + for (c = 0; c < n; c++) + scanf("%d", &array[c]); + + for (c = 0 ; c < n - 1; c++) + { + for (d = 0 ; d < n - c - 1; d++) + { + if (array[d] > array[d+1]) /* For decreasing order use < */ + { + swap = array[d]; + array[d] = array[d+1]; + array[d+1] = swap; + } + } + } + + printf("Sorted list in ascending order:\n"); + + for (c = 0; c < n; c++) + printf("%d\n", array[c]); + + return 0; +} \ No newline at end of file diff --git a/sorting/insertion.c b/sorting/insertion.c new file mode 100644 index 0000000..627fdb4 --- /dev/null +++ b/sorting/insertion.c @@ -0,0 +1,37 @@ +//programme to sort given element using insertion sort in O(n^2) time complexity. + +#include + +int main() +{ + int n, c, d, swap; + + printf("Enter number of elements\n"); + scanf("%d", &n); + int array[n]; + + printf("Enter %d integers\n", n); + + for (c = 0; c < n; c++) + scanf("%d", &array[c]); + + for (c = 1 ; c <= n - 1; c++) { + d = c; + + while ( d > 0 && array[d-1] > array[d]) { + swap = array[d]; + array[d] = array[d-1]; + array[d-1] = swap; + + d--; + } + } + + printf("Sorted list in ascending order:\n"); + + for (c = 0; c <= n - 1; c++) { + printf("%d\n", array[c]); + } + + return 0; +} \ No newline at end of file