View
144
Download
2
Category
Preview:
Citation preview
Algorithm A (insertion sort)O(n2) (very slow)
Algorithm B (merge sort)O(n log2 n) (pretty fast) Server A10 billion ops/sec (fast)
Server B10 million ops/sec (1000x slower)
Recommended