User Tools

Site Tools


Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
start [2014/07/10 23:00]
will [Data structures]
start [2016/05/23 22:58]
will
Line 1: Line 1:
-This wiki is an experiment in making algorithms interactive on the web. The algorithms on this wiki are not just some clever animations but are built on Tailspin ​a real [[interpreter|Javascript interpreter]],​ and the visualisations are based on the actual Javascript code running. The code is guaranteed to work+This wiki is an experiment in making algorithms interactive on the web. The algorithms on this wiki are not just some clever animations but are built on a real [[interpreter|Javascript interpreter]],​ and the visualisations are based on the actual Javascript code running. The code is guaranteed to work.
- +
-You can experiment more with the Javascript interpreter in a full IDE [[http://​will.thimbleby.net/​algorithms/​inspector]]. This is based on the WebKit inspector and there are plenty of quirks, probably more on non-WebKit browsers.+
  
 Allowing user supplied scripts has some security risks, for more information see [[Security]]. Allowing user supplied scripts has some security risks, for more information see [[Security]].
Line 8: Line 6:
  
 ==== Data structures ==== ==== Data structures ====
-  * [[Linked ​list]]+  * [[Linked ​List]]
   * [[Stack]]   * [[Stack]]
 +  * [[Queue]]
 +  * [[Hash table]]
 +
 ==== Searching ==== ==== Searching ====
   * [[Linear search]]   * [[Linear search]]
Line 15: Line 16:
  
 ==== Sorting ==== ==== Sorting ====
 +=== Comparison sorting ===
   * [[Bubble sort]]   * [[Bubble sort]]
   * [[Cocktail sort]]   * [[Cocktail sort]]
Line 21: Line 23:
   * [[Shell sort]]   * [[Shell sort]]
   * [[Quick sort]]   * [[Quick sort]]
-  * [[Bogosort]] 
   * [[Merge sort]]   * [[Merge sort]]
 +
 +=== Other sorting ===
 +  * [[Bogosort]]
 +  * [[Bucket sort]]
 +
 ==== Trees ==== ==== Trees ====
 +  * [[Binary search tree]]
 +  * [[B-tree]]
   * [[Depth-first search]]   * [[Depth-first search]]
   * [[Iterative deepening depth-first search]]   * [[Iterative deepening depth-first search]]
   * [[Breadth-first search]]   * [[Breadth-first search]]
 +  * [[Lowest common ancestor]]
   * [[Minimax search]]   * [[Minimax search]]
   * [[Minimax search with alpha-beta pruning]]   * [[Minimax search with alpha-beta pruning]]
 +
 +==== Graphs ====
 +  * [[Kruskals algorithm|Kruskal'​s algorithm]]
 +  * [[Dijkstras algorithm|Dijkstra'​s algorithm]]
 +
 ==== Math ==== ==== Math ====
   * [[GCD]]   * [[GCD]]
Line 38: Line 52:
   * [[Fisher-Yates shuffle]]   * [[Fisher-Yates shuffle]]
   * [[Binary to decimal]]   * [[Binary to decimal]]
-  * [[Kruskals algorithm|Kruskal'​s algorithm]] 
   * [[Is sorted]]   * [[Is sorted]]
 +  * [[Reversing an array]]
 +  * [[Reversing a string]]
 +  * [[Fowler–Noll–Vo hash function]]
 +  * [[Making change]]
  
   * [[Continuation passing style]]   * [[Continuation passing style]]
 +
 ===== Getting started ===== ===== Getting started =====
   * [[Creating an algorithm]]   * [[Creating an algorithm]]
start.txt · Last modified: 2016/05/23 22:58 by will