Create QuickSelect 2 partitions

Author: nkatre

QuickSelect 2 partitions

@@ -0,0 +1,32 @@
+Two Types of Partition Exists in QuickSelect
+Source: http://cs.stackexchange.com/questions/11458/quicksort-partitioning-hoare-vs-lomuto
+1. Lomuto -> To understand this watch this video: https://www.youtube.com/watch?v=MZaf_9IZCrc
+2. Hoare -> Normal i and j counter partition
+The code for Hoare parition is:
+private static int partition(int[] a, int low, int high) {
+		
+		int i = low;
+		int j = high;
+		int temp = 0;
+		
+		int pivot = a[low+(high-low)/2];
+		
+		while(i<=j){
+			while(a[i]<pivot)
+				i++;
+			while(a[j]>pivot)
+				j--;
+			if(i>j)
+				break;
+			else{ // if(i<=j)
+				temp=a[i];
+				a[i]=a[j];
+				a[j]=temp;
+				i++;
+				j--;
+			}
+		}
+		return i; // return the pivot index
+		
+	}
+*/