Quick Sort
def quickSort(arr,from,to) return if from >= to pivot = arr[from] i = from for j in (1+from)..to if arr[j] < pivot i = i + 1 temp = arr[i] arr[i] = arr[j] arr[j] = temp end end quickSort(arr,from,i-1); quickSort(arr,i+1,to); end
original_array=[2,19,5,4,3,14,2] puts "Sorted Array Using Quick Sort:" quickSort(original_array,0,original_array.length - 1) p original_array
Check out some of our other Ruby Tutorials :
Introduction to Ruby
Introduction to Ruby and some playing around with the Interactive Ruby Shell (irb) | Introduction to Ruby - Conditional statements and Modifiers: If-then, Unless, Case | Introduction to Ruby Comments - Single and Multi-Line comments | Introduction to Ruby Loops - Using While, Until, For, Break, Next , Redo, Retry | Introduction to Ruby - Arrays - Sorting, Filtering (Select), Transforming, Multi-Dimensional Arrays | Introduction to Ruby - Strings | Introduction to Ruby - Making a Script Executable | Introduction to Ruby - Regular Expressions, Match, Scan | Introduction to Ruby - Computing Factorials Recursively : An Example of Recursion | Introduction to Ruby - Binomial Coefficients (nCr) : An Example of Recursion | Introduction to Ruby - Computing a Power Set : An Example of Recursion | Introduction to Ruby - Towers of Hanoi : An Example of Recursion | Introduction to Ruby - Strings: Substitution, Encoding, Built-In Methods | |
|
|
Basic Data Structures With Ruby
|
|