Re: [algogeeks] BIG O

Can somebody explain how it is O(n log n). What is the significance of while loop in the above code? I understand that the for loop implies O(n),does the log n in the O(n log n) comes from the while loop? What if there where two while loops in the for loop separately? On Sat, Oct 27, 2012 at

[algogeeks] Hanoi problem

Please help me out with Hanoi problem of n disks. Algorithm and code preferably in C++. http://en.wikipedia.org/wiki/Tower_of_Hanoi -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

Re: [algogeeks] Given an array of 32bit unsigned integers in which every number appears exactly twice except three of them, find those three numbers in O(n) time using O(1) extra space

Please help me out with Hanoi problem of n disc problem. Algorithm and code preferably in C++. http://en.wikipedia.org/wiki/Tower_of_Hanoi -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to