Sorting Visualizer

# of swaps:
# of inserts:
# of shifts per insert:
# of comparisons:

Prewritten sorts:

Write some code in CoffeeScript and hit run. The array will show what's going on.

Use the following methods on VA:

swap(i, j): Swap the values at indices i and j.
insert(i, j): Move the value at index i to index j and slide the elements in between to fill.
get(i): Return the value of the element at i.
lt(i, j): Return the result of VA.get(i) < VA.get(j).
lte(i, j): Return the result of VA.get(i) <= VA.get(j).
gt(i, j): Return the result of VA.get(i) > VA.get(j).
gte(i, j): Return the result of VA.get(i) >= VA.get(j).
eq(i, j): Return the result of VA.get(i) == VA.get(j).
neq(i, j): Return the result of VA.get(i) != VA.get(j).
highlight(i): Highlight the i^th element.
highlight([i₁, i₂...i_n]): Highlight the i₁^th, i₂^th... i_n^th elements.
persistHighlight(i): Highlight the i^th element until the next persistHighlight call.
persistHighlight([i₁, i₂...i_n]): Highlight the i₁^th, i₂^th... i_n^th elements until the next persistHighlight call.
locals: A map (initially empty) where you can store primitives that you want to see as the sort animates. See bubble sort for an example.

Try out the prewritten sorts for syntax examples.

Notes:

Nothing will display if there is an infinite loop.
The "Stop" button won't save the state of your code, but will save the state of the array.
The items are integers in the range of 0 to 2^10-1. There may be duplicates.

Email me at thedufer at gmail dot com with comments/questions!