Name: Anonymous 2014-12-06 15:17
Hello my students, today we will talk about Sleepsort.
Consider N lolies!, each one of them holding a paper with a integer on it and all of them standing in a line.
They all look at the clock and at the second that is equal to the integer written on their paper they get into a queue.
When the process finishes you have a ordered, ascending queue of lolies! in O(1).
So that's all, come back to the next lesson.
Consider N lolies!, each one of them holding a paper with a integer on it and all of them standing in a line.
They all look at the clock and at the second that is equal to the integer written on their paper they get into a queue.
When the process finishes you have a ordered, ascending queue of lolies! in O(1).
So that's all, come back to the next lesson.