second attemtp to solve quicksort issue

.gitignore

@@ -2,6 +2,7 @@ tasks/quodnon/week_1/count_revercies_cs/bin/
 tasks/quodnon/week_1/count_revercies_cs/obj/
 tasks/quodnon/**/obj/
 tasks/quodnon/**/bin/
+tasks/quodnon/**/.suo
 # quodnon stuff
 
 *.iml

tasks/quodnon/week2/quick_fun/Program.cs

@@ -12,19 +12,34 @@ static void Main(string[] args)
         {
             Console.WriteLine("Hello World! with good git config ");
             var unsortedArr = File.ReadAllText("QuickSort.txt").Split('\n').Select(x => Int32.Parse(x)).ToArray();
-
+            /*
+             * get array
+             * put it in sorter
+             * put in counter in sorter
+             * inside sorter:
+             * - init 2 indexes
+             * - take first element
+             * - swap swap swap
+             * .
+             * get result from sorter
+             */
+            Console.WriteLine("Gello, worldd{0}", 1);
 
         }
 
-        enum pivotPoint{
-            Last=0,
-            First=1,
-            Middle=2
+        enum pivotPoint {
+            Last = 0,
+            First = 1,
+            Middle = 2
         }
-
-        static int[] QuickSort (int [] array, enum pivotPoin, out int counter)
+        int [] partition(int[] array,
+        int[] QuickSort(int[] array, pivotPoint point, out int counter)
         {
-
+            var s = new int[] { 1, 2, 3, 4 };
+            counter = 10;
+
+
+            return s;
         }
     }
 }

tasks/quodnon/week2/quick_fun/QuickSort.txt

@@ -9997,4 +9997,4 @@
 8640
 7266
 5792
-9269
+9269