Merge pull request #155 from nitish14kumr/master

Recursive Bubble Sort

Author: Bhrigu Kansra

Algorithms/sorting/C++/recursiveBubbleSort.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+void bubbleSort(int arr[], int n) 
+{ 
+    if (n == 1) 
+        return;  
+    for (int i=0; i<n-1; i++) 
+        if (arr[i] > arr[i+1]) 
+            swap(arr[i], arr[i+1]); 
+    bubbleSort(arr, n-1); 
+} 
+  
+void printArray(int arr[], int n) 
+{ 
+    for (int i=0; i < n; 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; 
+} 

Algorithms/sorting/Python/insertionsort.py

@@ -1,15 +1,15 @@
-def insertionSort(alist):
-   for index in range(1,len(alist)):
-
-     currentvalue = alist[index]
-     position = index
-
-     while position>0 and alist[position-1]>currentvalue:
-         alist[position]=alist[position-1]
-         position = position-1
-
-     alist[position]=currentvalue
-
-alist = [54,26,93,17,77,31,44,55,20]
-insertionSort(alist)
-print(alist)
+def insertionSort(alist):
+   for index in range(1,len(alist)):
+
+     currentvalue = alist[index]
+     position = index
+
+     while position>0 and alist[position-1]>currentvalue:
+         alist[position]=alist[position-1]
+         position = position-1
+
+     alist[position]=currentvalue
+
+alist = [54,26,93,17,77,31,44,55,20]
+insertionSort(alist)
+print(alist)

contributors.md

@@ -41,6 +41,7 @@
 39. [Sanka Mohottala](https://github.com/sankamohottala)
 40. [Riya Singh](https://github.com/riya24899)
 41. [Sarthak gupta](https://github.com/sarthak-g)
-42. [Your Name](https://github.com/yourusername)
+42. [Nitish Kumar](https://github.com/nitish14kumr)
 43. [Seemant Aggarwal] (https://github.com/seemantaggarwal)
 44. [Vibhav Tiwari] (https://github.com/VibhavTiwari)
+45. [Your Name](https://github.com/yourusername)