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

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

Re: [algogeeks] Doubt on Regular Expression

i am not sure , but wont x.trim() will remove extra spaces from the string... On Wed, Apr 4, 2012 at 12:32 AM, Debabrata Das debabrata.barunhal...@gmail.com wrote: Hi All, I was looking for an regular expression such that given a string X,it should exclude a token in single quote preceded

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!!! --