added quick sort and insertion sort

Author: sarthak-21

C/Algorithms/Sorting-Algorithms/InsertionSort/InsertionSort.cpp

@@ -0,0 +1,36 @@
+#include<stdio.h>
+
+int main(void)
+
+{
+ int array[25], n, temp, j;
+ 
+ printf("Enter the number of entries: ");
+ scanf("%d", &n);
+ printf("Enter the %d elements: ", n);
+ //user-input
+ for(int i = 0; i < n; i++)
+ {
+ scanf("%d", &array[i]);
+ }
+ //The main algo of insertion-sort
+ //it considers first to be smallest then compares, if other number is found smaller then the choosen one then that number is taken out
+ //now shift the sorted elemnt according to how smaaler the number is taken out and so on...
+ for(int i = 1; i < n; i++)
+ {
+ temp = array[i];
+ j = i - 1;
+ while((temp < array[j]) && (j >= 0))
+ {
+ array[j + 1] = array[j];
+ j = j - 1;
+ }
+ array[j + 1] = temp;
+ }
+ //printing the sorted array
+ printf("The sorted array is: \n");
+ for(int i = 0; i < n; i++)
+ {
+ printf("%d ", array[i]);
+ }
+}

C/Algorithms/Sorting-Algorithms/InsertionSort/README.md

@@ -0,0 +1,33 @@
+<h1 align=center>Insertion Sort</h1>
+
+### Note: THE PROGRAM IS IN C 
+</br>
+
+Here's a brief about Insertion sort. </br>
+
+`The idea of this algorithm is to build your sorted array in place, shifting elements out of the way if necessary to make room as you go.` </br>
+
+### Sample Input-1
+```
+4
+34 21 43 56
+```
+
+### Sample Output
+The sorted array is: </br>
+21 34 43 56
+
+### Sample Input-2
+```
+10
+44 23 56 21 54 65 87 96 54 99
+```
+
+### Sample Output
+The sorted array is: </br>
+21 23 44 54 54 56 65 87 96 99 </br>
+
+Now see the codes for proper understanding of Algorithm.</br>
+
+### Contributed by:
+[*Sarthak Luthra*](https://github.com/sarthak-21)

C/Algorithms/Sorting-Algorithms/QuickSort/QuickSort.cpp

@@ -0,0 +1,33 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int values[] = { 88, 56, 100, 2, 25 };
+//you can take user input as well
+
+//comparison function
+int cmpfunc (const void * a, const void * b) {
+ return ( *(int*)a - *(int*)b );
+}
+
+int main () {
+ int n;
+ printf("Before sorting the list is: \n");
+ for( n = 0 ; n < 5; n++ ) {
+ printf("%d ", values[n]);
+ }
+
+ qsort(values, 5, sizeof(int), cmpfunc);
+//qsort(void *base, size_t items, size_t size, int (*compar)(const void *, const void*))
+
+/* base - This is the pointer to the fisrt element of array
+items - This is the number of elements in the array
+size - This is the sizxe in bytes of each element in the array
+compar - This is the function that compares two element */
+
+ printf("\nAfter sorting the list is: \n");
+ for( n = 0 ; n < 5; n++ ) { 
+ printf("%d ", values[n]);
+ }
+
+ return(0);
+}

C/Algorithms/Sorting-Algorithms/QuickSort/README.md

@@ -0,0 +1,14 @@
+<h1 align=center>Quick Sort</h1>
+
+### Note: THE PROGRAM IS IN C 
+</br>
+
+Here's a brief about Quick sort. </br>
+
+`Like merge sort, Quick sort is a divide and conquer algorithm.` </br>
+`It picks an element as pivot and partition the given array around the picked pivot.` </br>
+
+Now see the codes for proper understanding of Algorithm.</br>
+
+### Contributed by:
+[*Sarthak Luthra*](https://github.com/sarthak-21)