Is this correct for finding big o and calculating the cost and time for the counting-sort algorithm?
Fantastic news! We've Found the answer you've been seeking!
Question:
Is this correct for finding big o and calculating the cost and time for the counting-sort algorithm? If not, please explain why and what's wrong. When I add it up I get 4n + 4k -5 = o(n + k), but the book says is 2n + 2k
Related Book For
Foundations of Financial Management
ISBN: 978-1259024979
10th Canadian edition
Authors: Stanley Block, Geoffrey Hirt, Bartley Danielsen, Doug Short, Michael Perretta
Posted Date: