ayoub-root
diff --git a/‎BinarySearch/java/BinarySearchRecursive‎ ‎BinarySearch/Java/BinarySearchRecursive‎BinarySearch/java/BinarySearchRecursive renamed to BinarySearch/Java/BinarySearchRecursive b/‎BinarySearch/java/BinarySearchRecursive‎ ‎BinarySearch/Java/BinarySearchRecursive‎BinarySearch/java/BinarySearchRecursive renamed to BinarySearch/Java/BinarySearchRecursive
diff --git a/‎BinarySearch/java/binarySerach.java‎ ‎BinarySearch/Java/binarySerach.java‎BinarySearch/java/binarySerach.java renamed to BinarySearch/Java/binarySerach.java b/‎BinarySearch/java/binarySerach.java‎ ‎BinarySearch/Java/binarySerach.java‎BinarySearch/java/binarySerach.java renamed to BinarySearch/Java/binarySerach.java
diff --git a/‎BinarySearch/python/binarySearch.py‎ ‎BinarySearch/Python/binarySearch.py‎BinarySearch/python/binarySearch.py renamed to BinarySearch/Python/binarySearch.py b/‎BinarySearch/python/binarySearch.py‎ ‎BinarySearch/Python/binarySearch.py‎BinarySearch/python/binarySearch.py renamed to BinarySearch/Python/binarySearch.py
diff --git a/‎BubbleSort/C_Sharp/Bubble_sort.cs‎ ‎BubbleSort/C#/Bubble_sort.cs‎BubbleSort/C_Sharp/Bubble_sort.cs renamed to BubbleSort/C#/Bubble_sort.cs b/‎BubbleSort/C_Sharp/Bubble_sort.cs‎ ‎BubbleSort/C#/Bubble_sort.cs‎BubbleSort/C_Sharp/Bubble_sort.cs renamed to BubbleSort/C#/Bubble_sort.cs
diff --git a/‎Dijkstra's /Javascript‎ ‎Dijkstra's /JavaScript/Dijkstras.js‎Dijkstra's /Javascript renamed to Dijkstra's /JavaScript/Dijkstras.js b/‎Dijkstra's /Javascript‎ ‎Dijkstra's /JavaScript/Dijkstras.js‎Dijkstra's /Javascript renamed to Dijkstra's /JavaScript/Dijkstras.js
diff --git a/‎InsertionSort/C_sharp/Insertion_sort.cs‎ ‎InsertionSort/C#/Insertion_sort.cs‎InsertionSort/C_sharp/Insertion_sort.cs renamed to InsertionSort/C#/Insertion_sort.cs b/‎InsertionSort/C_sharp/Insertion_sort.cs‎ ‎InsertionSort/C#/Insertion_sort.cs‎InsertionSort/C_sharp/Insertion_sort.cs renamed to InsertionSort/C#/Insertion_sort.cs
diff --git a/‎InsertionSort/java/insertionsort.java‎ ‎InsertionSort/Java/insertionsort.java‎InsertionSort/java/insertionsort.java renamed to InsertionSort/Java/insertionsort.java b/‎InsertionSort/java/insertionsort.java‎ ‎InsertionSort/Java/insertionsort.java‎InsertionSort/java/insertionsort.java renamed to InsertionSort/Java/insertionsort.java
diff --git a/‎InsertionSort/python/insertionSort.py‎ ‎InsertionSort/Python/insertionSort.py‎InsertionSort/python/insertionSort.py renamed to InsertionSort/Python/insertionSort.py b/‎InsertionSort/python/insertionSort.py‎ ‎InsertionSort/Python/insertionSort.py‎InsertionSort/python/insertionSort.py renamed to InsertionSort/Python/insertionSort.py
diff --git a/‎QuickSort/Ruby/quicksort.rb‎
Lines changed: 13 additions & 0 deletions b/‎QuickSort/Ruby/quicksort.rb‎
Lines changed: 13 additions & 0 deletions
diff --git a/‎README.md‎
Lines changed: 23 additions & 23 deletions b/‎README.md‎
Lines changed: 23 additions & 23 deletions
@@ -0,0 +1,13 @@
+class Array
+  def quicksort
+    return [] if empty?
+
+    pivot = delete_at(rand(size))
+    left, right = partition(&pivot.method(:>))
+
+    return *left.quicksort, pivot, *right.quicksort
+  end
+
+  array = [15, 23, 1, 9, 10, 2, 5]
+  p array.quicksort
+end
@@ -9,39 +9,39 @@ Language| Java | Python | Rust | C | C++ | JavaScript  | Go | C# | Ruby |
 --- | --- | --- | --- |--- |--- |--- |--- |--- |--- |
 A*Search |  |  |  |  | :+1: |  |  |  |
 BellmanFord | :+1: |  |  |  |  |  |  |  |
-BestFirstSearch | :+1: |  |  |  |  |  |  |  | 
+BestFirstSearch | :+1: |  |  |  |  |  |  |  |
 BinarySearch | :+1: | :+1: |  |  | :+1: | :+1: | :+1: |  |  
-Bitap Algorithm |  |  |  |  | :+1: |  |  |  | 
-BreadthFirstSearch | :+1: | :+1: |  | :+1: |  |  |  |  | 
-BubbleSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |  |  | 
-DepthFirstSearch |  |  |  |  | :+1: |  |  |  | 
-Dijkstra's  | :+1: |  |  |  | :+1: |  |  |  | 
-Doomsday | :+1: |  |  |  |  | :+1: |  |  | 
+Bitap Algorithm |  |  |  |  | :+1: |  |  |  |
+BreadthFirstSearch | :+1: | :+1: |  | :+1: |  |  |  |  |
+BubbleSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |  |  |
+DepthFirstSearch |  |  |  |  | :+1: |  |  |  |
+Dijkstra's  | :+1: |  |  |  | :+1: |  |  |  |
+Doomsday | :+1: |  |  |  |  | :+1: |  |  |
 ElevatorAlgorithm | :+1: |  |  |  |  |  |  |  |  
 Fibonacci | :+1: | :+1: |  | :+1: |  |  | :+1: |  |
 FisherYatesShuffle | :+1: |  |  |  | :+1: |  |  | :+1: |
-Floyd'sAlgorithm |  | :+1: |  |  | :+1: |  |  |  | 
+Floyd'sAlgorithm |  | :+1: |  |  | :+1: |  |  |  |
 GreatestCommonDivisor | :+1: |  |  | :+1: |  |  |  |  |
 HeapSort | :+1: |  |  |  | :+1: | :+1: | :+1: |  | :+1:
-HistogramEqualization | :+1: |  |  |  |  |  |  |  | 
+HistogramEqualization | :+1: |  |  |  |  |  |  |  |
 InsertionSort | :+1: | :+1: | :+1: |  |  |  | :+1: | :+1: |  
-Johnson algorithm |  |  |  |  | :+1: |  |  |  | 
+Johnson algorithm |  |  |  |  | :+1: |  |  |  |
 Kadane's algorithm | :+1: | :+1: |  |  | :+1: | :+1: | :+1: |  |  
 LinearSearch | :+1: | :+1: |  |  | :+1: | :+1: |  |  |  |  |
-Longest-Common-Subsequence | :+1: | :+1: |  |  | :+1: |  |  |  | :+1: 
-Longest-Increasing-Subsequence | :+1: |  |  |  |  |  |  |  | 
-LongestPath |  |  |  |  | :+1: |  |  |  | 
-MergeSort | :+1: | :+1: |  | :+1: | :+1: | :+1: | :+1: |  | 
-MiniMaxWithABPruning | :+1: |  |  |  |  |  |  |  | 
-Modified_Binary_Search |  |  |  | :+1: |  |  |  |  | 
-Postman Sort |  |  |  | :+1: |  |  |  |  | 
-Quick Sort |  |  |  |  |  |  |  | :+1: | 
-Uniform-cost search | :+1: |  |  |  |  | :+1: | :+1: |  | 
-RadixSort | :+1: | :+1: |  |  | :+1: |  |  |  | 
-RobinCarp | :+1: |  |  |  |  |  |  |  | 
-SelectionSort | :+1: | :+1: |  | :+1: | :+1: | :+1: | :+1: |  | :+1: 
+Longest-Common-Subsequence | :+1: | :+1: |  |  | :+1: |  |  |  | :+1:
+Longest-Increasing-Subsequence | :+1: |  |  |  |  |  |  |  |
+LongestPath |  |  |  |  | :+1: |  |  |  |
+MergeSort | :+1: | :+1: |  | :+1: | :+1: | :+1: | :+1: |  |
+MiniMaxWithABPruning | :+1: |  |  |  |  |  |  |  |
+Modified_Binary_Search |  |  |  | :+1: |  |  |  |  |
+Postman Sort |  |  |  | :+1: |  |  |  |  |
+Quick Sort | :+1: | :+1: |  |  |  | :+1: | :+1: | :+1: |  :+1:
+Uniform-cost search | :+1: |  |  |  |  | :+1: | :+1: |  |
+RadixSort | :+1: | :+1: |  |  | :+1: |  |  |  |
+RobinCarp | :+1: |  |  |  |  |  |  |  |
+SelectionSort | :+1: | :+1: |  | :+1: | :+1: | :+1: | :+1: |  | :+1:
 ShellSort | :+1: | :+1: |  |  | :+1: |  |  |  |  
-SieveofEratosthenes | :+1: | :+1: |  |  | :+1: |  |  |  | 
+SieveofEratosthenes | :+1: | :+1: |  |  | :+1: |  |  |  |
 UnaryCoding | :+1: | :+1: |  |  |  | :+1: |  |  |  
 TernarySearch |  |  |  |  | :+1: |  |  |  |