astopo

// Use Gists to store code you would like to remember later on
console.log(window); // log the "window" object to the console

astopo

def maximum(numbers)
    largest = numbers.first
    index = 0

    # keep looping over every element in the array
    while index < numbers.size

        # check to see if current number is larger than the largest one so far

astopo

# 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