/examples/computer_science/merge_sort.coffee
http://github.com/jashkenas/coffee-script · CoffeeScript · 18 lines · 10 code · 6 blank · 2 comment · 4 complexity · 235da5969b104924627c4b49b41c5ac7 MD5 · raw file
- # Sorts an array in ascending natural order using merge sort.
- merge_sort = (list) ->
- return list if list.length is 1
- pivot = Math.floor list.length / 2
- left = merge_sort list.slice 0, pivot
- right = merge_sort list.slice pivot
- result = while left.length and right.length
- if left[0] < right[0] then left.shift() else right.shift()
- result.concat(left).concat(right)
- # Test the function.
- console.log merge_sort([3, 2, 1]).join(' ') is '1 2 3'
- console.log merge_sort([9, 2, 7, 0, 1]).join(' ') is '0 1 2 7 9'