Pages

Wednesday, February 9, 2011

Sorting Digits of a Number

Q A function takes numbers as inputs and arranges them in O(n) in ascending order

Same as my last post we will use merge sort here.A merge sort has a complexity of O(n) so we can sort the number in O(n)

No comments:

Post a Comment