Please help me to understand on how to write an algorithm ( pseudo-code) that takes an unsorted
Fantastic news! We've Found the answer you've been seeking!
Question:
Please help me to understand on how to write an algorithm (pseudo-code) that takes an unsorted list of n integers and outputs a sorted list of all duplicate integers. There must be no duplicates in the output list, also the output list should be a sorted list. The algorithm must run in O(n) time. Show your analysis of the running time.
Note: Assume that inputs are integer values from 0 to 255. (Hint: use the concept that being used in the
separate chaining)
Example {5,4,10,2,4,10,5,3,1}
Output: 4, 5, 10
Related Book For
Posted Date: