Computer Science AQA A level: Order these from longest time to complete to least:
O(log n),
O(1),
O(n log n),
O(2^n),
O(n),
O(n^2),
O(n!)

Question

Order these from longest time to complete to least:
O(log n), 
O(1), 
O(n log n), 
O(2^n),
 O(n), 
O(n^2), 
O(n!)

Will Parker · Accepted Answer

O(n!)
O(2^n)
O(n^2)
O(n log n)
 O(n)
O(log n)
O(1)

Order these from longest time to complete to least: O(log n), O(1), O(n log n), O(2^n), O(n), O(n^2), O(n!)