Re: [algogeeks] Given an array A[1..n] of log n bit integers, sort them in-place in O(n) time
Can you please explain the question again. As what I understood according to me the question is size of array : n and the range of the elements present at each location is log n. On Wed, Apr 4, 2012 at 2:57 AM, Doom duman...@gmail.com wrote: Any ideas? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/aGzMcjTFcAYJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Given an array A[1..n] of log n bit integers, sort them in-place in O(n) time
if the length of the binary representation of elements is logn, then the elements themselves are of size less than 2^log(n)=n. as all the elements are less than n, use counting sort!!! -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Given an array A[1..n] of log n bit integers, sort them in-place in O(n) time
how are you going to do it in-place? On Wednesday, 4 April 2012 13:24:01 UTC+5:30, Siddhartha wrote: if the length of the binary representation of elements is logn, then the elements themselves are of size less than 2^log(n)=n. as all the elements are less than n, use counting sort!!! -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/glXPUeyoh8IJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Given an array A[1..n] of log n bit integers, sort them in-place in O(n) time
Any ideas? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/aGzMcjTFcAYJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.