You're taking your first steps into Ruby
A good introduction to programming in general. Easy on newer programmers.
You're taking your first steps into Ruby
A good introduction to programming in general. Easy on newer programmers.
| # Sample implementation of quicksort and mergesort in ruby | |
| # Both algorithm sort in O(n * lg(n)) time | |
| # Quicksort works inplace, where mergesort works in a new array | |
| def quicksort(array, from=0, to=nil) | |
| if to == nil | |
| # Sort the whole array, by default | |
| to = array.count - 1 | |
| end |