Merge pull request #33 from rattle99/master

add quicksort

Sorting/quickSort/quick.cpp

@@ -0,0 +1,64 @@
+/*Program for quick sort implementation in C++. */
+
+#include <iostream>
+#include <vector>
+
+int partition(std::vector<int> &A, int start, int end)
+{
+	int temp;
+	int pivot = A[end];
+	int partitionIndex = start; // set partition index as start initially
+	for(int i=start; i<end; i++)
+	{
+		if(A[i] <= pivot)
+		{
+			temp=A[i];
+			A[i]=A[partitionIndex];
+			A[partitionIndex]=temp;
+			partitionIndex++;
+		}
+	}
+	temp=A[partitionIndex];		//	Swap pivot element
+	A[partitionIndex]=A[end];	//	eith element at
+	A[end]=temp;			//	partition index
+
+	return partitionIndex;
+}
+
+std::vector<int> quick_sort(std::vector<int> &A, int start, int end)
+{
+/*        std::cout<<"Current list : \n";
+        for(int i=0;i<A.size();i++)
+        {
+                std::cout<<A[i]<<" ";
+        }
+        std::cout<<"\nSorted list : \n";
+*/
+
+	if(start<end)
+	{
+		int partitionIndex = partition(A,start,end);
+		quick_sort(A,start,partitionIndex-1);
+		quick_sort(A,partitionIndex+1, end);
+	}
+
+/*        for(int i=0;i<A.size();i++)
+        {
+                std::cout<<A[i]<<" ";
+        }
+*/        return A;
+}
+
+int main()
+{
+        std::cout<<"\nTest\n";
+        std::vector<int> arr={10,2,23,-4,235,56,2,6,5,5,5,23,-4,346,-56,81,43,654,435,-54};
+        quick_sort(arr, 0, arr.size()-1);
+        std::cout<<"\n\n\n";
+        for(int i=0;i<arr.size();i++)
+        {
+                std::cout<<arr[i]<<" ";
+        }
+        return 0;
+}
+

data structures/menu driven stack and queue → data structures/menu-driven-stack-and-queue.cpp

@@ -1,6 +1,6 @@
 #include <iostream>
 #include <stdlib.h>
-#include <conio.h>
+
 
 using namespace std;
 void stck();
@@ -47,7 +47,7 @@ void stck_ins_arr()
         st[top] = data;
     }
     cout << "\nElement inserted succesfully\n";
-    getch();
+    getchar();
     stck();
 }
 
@@ -63,7 +63,7 @@ void stck_del_arr()
         top--;
         cout << "\nElement deleted succesfully\n";
     }
-    getch();
+    getchar();
     stck();
 }
 void stck_print()
@@ -88,7 +88,7 @@ void stck_print()
                  << "\n";
         }
     }
-    getch();
+    getchar();
     stck();
 }
 void stck()
@@ -136,7 +136,7 @@ void que_ins_arr()
 
     cout << "\nElement inserted succesfully\n";
 
-    getch();
+    getchar();
     que();
 }
 void que_del_arr()
@@ -153,7 +153,7 @@ void que_del_arr()
         cout << "\nElement deleted succesfully\n";
     }
 
-    getch();
+    getchar();
     que();
 }
 void que_print()
@@ -166,7 +166,7 @@ void que_print()
         cout << q[i] << " | ";
     }
 
-    getch();
+    getchar();
     que();
 }
 void que()
@@ -214,7 +214,7 @@ void stck_ins_list()
         head = temp;
     }
     cout << "\nElement insereted successfully\n";
-    getch();
+    getchar();
     stck_list();
 }
 void stck_del_list()
@@ -232,7 +232,7 @@ void stck_del_list()
         free(temp);
     }
     cout << "\nElement deleted succesfully!!\n";
-    getch();
+    getchar();
     stck_list();
 }
 void stck_print_list()
@@ -258,7 +258,7 @@ void stck_print_list()
             temp = temp->next;
         }
     }
-    getch();
+    getchar();
     stck_list();
 }
 
@@ -307,7 +307,7 @@ void que_ins_list()
         head = temp;
     }
     cout << "\nElement inserted succesfully\n";
-    getch();
+    getchar();
     que_list();
 }
 void que_del_list()
@@ -339,7 +339,7 @@ void que_del_list()
         temp1->next = NULL;
     }
     cout << "\nElement deleted succesfully!!\n";
-    getch();
+    getchar();
     que_list();
 }
 void que_print_list()
@@ -362,7 +362,7 @@ void que_print_list()
             temp = temp->next;
         }
     }
-    getch();
+    getchar();
     que_list();
 }