Pick up the book "introduction to algorithms: Cormen" or "data structures:tanenbaum" It's available in you library. Go through it. Also browse the websites given by the others above
>They all sit in a circle such that their numbering order is also maintained, >so that the last person (numbered N) sits adjacent to the first person >(numbered 1). For a person of your calibre it would be better if you used the phrase "circular queue", rather than such an elaborate definition. This particular problem know by the name "josephus permutation/problem" is a classic problem w.r.t. circular queues and is found in almost all good books on algorithms. Regards, Nupul. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
