Sorting : O(nlogn) time
So hash map solution will also same time. I guess one can customize it
according to the requirements and constraints.
On Sun, Oct 3, 2010 at 11:50 AM, kusuma sanjeev wrote:
> array elements: 1 2 9 8 7 5 2 3 1 1 4 2 6 2 3
> sort: 1 1 1 2 2 2 2 3 3 4 5 6 7 8 9
> compare the
@kusuma main concern is how will you create the list which are coming once.
you have to check the current value with all values you pushed into the list
and if match occures you have to delete the element from existing list and
insert in next list having index greater by one. and if duplication no
In hash map insertion and seach take O(logn) time but less space.
So according to sharad insert all elements in hash map which will take
O(nlogn) time and 0(n) space.
But if you are sure about the range of numbers which would appear in the
list, you can use counting mechanism. Like if you know nu
array elements: 1 2 9 8 7 5 2 3 1 1 4 2 6 2 3
sort: 1 1 1 2 2 2 2 3 3 4 5 6 7 8 9
compare the element with the next , if its same then increment the count.
repeat until v find all the occurrences of tat element & then insert tat
element into arr[count] (if arr[count] is null else traverse the list
how will this give me array_1 which lists all numbers comming 1 time ,
array_2 which lists all numbers comming 2 time etc ?
On Sun, Oct 3, 2010 at 11:31 AM, kusuma sanjeev wrote:
> One possible solution would be to create an array of pointers to the list..
> array index indicates how many time
One possible solution would be to create an array of pointers to the list..
array index indicates how many times the element occurs and the list gives
the elements.
On Sun, Oct 3, 2010 at 11:22 AM, sharad kumar wrote:
> it will take same amount of memory nakey value is element and vaule is
>
it will take same amount of memory nakey value is element and vaule is
the amount of times element occurs.
On Sun, Oct 3, 2010 at 11:11 AM, mac adobe wrote:
> i think hash map takes lots of memory ... please correct me if i am wrong
> here ..
>
> anyways its a soluton but i would like t
i think hash map takes lots of memory ... please correct me if i am wrong
here ..
anyways its a soluton but i would like to have a different solution .. :)
--mac
On Sun, Oct 3, 2010 at 10:55 AM, sharad kumar wrote:
> cant u use a hash map buddy???
>
> On Sun, Oct 3, 2010 at 10:35 AM, mac adobe
cant u use a hash map buddy???
On Sun, Oct 3, 2010 at 10:35 AM, mac adobe wrote:
> You are given a very long array of integers . Some number in this integer
> array come 1 time , some 2 times some 3 times . create 3 different arrays .
>
> Array 1 will have numbers with numbers comming only1 time
You are given a very long array of integers . Some number in this integer
array come 1 time , some 2 times some 3 times . create 3 different arrays .
Array 1 will have numbers with numbers comming only1 time , Array 2 will
have numbers with numbers comming 2 times, Array 3 will have numbers with
n
10 matches
Mail list logo
