Re: [algogeeks] Re: Required O(n) Algorithm

2012-04-22 Thread saurabh singh
@illya read the posts in the thread.Count sort is O(n) sorting algorithm.The constraints in this algorithm is that the maximum value of the array to be sorted should not be large. Saurabh Singh B.Tech (Computer Science) MNNIT blog:geekinessthecoolway.blogspot.com On Mon, Apr 23, 2012 at 5:25 AM,

[algogeeks] Re: Required O(n) Algorithm

2012-04-22 Thread Ilya Albrekht
I'm not aware of any O(n) sort algorithms. Any (known) sort algorithm can have O(n) iff array is already sorted - kinda trivial case. So sort will not work for this task... On Wednesday, 18 April 2012 06:41:38 UTC-7, Dave wrote: > > @Viharri: A solution seems to require an O(n) sorting algorithm

[algogeeks] Direct-i Onsite Round Questions

2012-04-22 Thread Algo-Geek
Hi geeks !!! I have an onsite interview of Direct-i scheduled next month. They said - " There are 2 rounds - algo round + final round ". Plzzz share the questions if any or atleast share your ideas regarding what and how to prepare for the onsite round. Thanx -- You received this message bec