Mikk Kirstein kirstein
aeharding
/ timeoutSort.coffee
Last active
August 29, 2015 14:05
Sort an array of positive integers using timeouts. *genius*
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Only works with positive numbers #dealwithit | |
| timeoutSort = (arr, cb) -> | |
| ret = [] | |
| longest = 0 | |
| for t in arr then do -> | |
| longest = t if t > longest | |
| tmp = t | |
| setTimeout -> | |
| ret.push tmp | |
| , t |