@Luciano
Your method seems very vague. Can you elaborate ? The
input can have elements larger than 9. So will you keep count of those
elements with a numeric array of size 10. Also, your second step is
not clear.
Pls elaborate
On Jul 8, 8:17 pm, jalaj jaiswal <[email protected]> wrote:
> @ above
> the array according to you will be
> 0 2 1 4 0 1 0 0 0 0
> for my input array 1,3,3,1,2,3,5,2,3
> ""Then put in order this array,"""------------ i din get this
> wht to do next .. plzz explain
>
> On Fri, Jul 9, 2010 at 5:22 AM, Luciano Junior <[email protected]>wrote:
>
>
>
> > You only need to take a numeric array [0 .. 9], counting each number
> > of input incrementing the array index. Then put in order this array,
> > then print in reverse order.
>
> > Luciano Pinheiro.
>
> > 2010/7/6 Abhirup Ghosh <[email protected]>:
> > > We can build a wrapper object having two fields one th actual integer
> > > in the array and the count o the integer in the given array. Then
> > > build an array of those objects. Range of this array can be found
> > > easily by finding max and min of the array in O(n) time. We can build
> > > the auxiliary array in O(n) time. Then we can sort that array on the
> > > basis of count field using counting sort in O(n). As counting sort is
> > > stable sort if two counts are equal then the sequence is maintained.
> > > So the whole process is done in O(n). But the space complexity is O(n)
> > > as two auxiliary arrays are needed.
>
> > > -Abhirup
>
> > > On Sun, Jul 4, 2010 at 3:20 AM, Amir hossein Shahriari
> > > <[email protected]> wrote:
> > >> we can apply that case in the comparator or sort them after counting
> > again
> > >> in nlogn (with respect to number of occurrences and their first index)
> > >> since the first occurrence of a number happens when it's not inserted in
> > bst
> > >> we can do this easily
>
> > >> --
> > >> You received this message because you are subscribed to the Google
> > Groups
> > >> "Algorithm Geeks" group.
> > >> To post to this group, send email to [email protected].
> > >> To unsubscribe from this group, send email to
> > >> [email protected]<algogeeks%[email protected]>
> > .
> > >> 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 [email protected].
> > > To unsubscribe from this group, send email to
> > [email protected]<algogeeks%[email protected]>
> > .
> > > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> > --
> > ----------------------------------------
> > Luciano Soares Pinheiro Jr.
> > Analista desenvolvedor Sr.
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to [email protected].
> > To unsubscribe from this group, send email to
> > [email protected]<algogeeks%[email protected]>
> > .
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
>
> --
> With Regards,
> Jalaj Jaiswal
> +919026283397
> B.TECH IT
> IIIT ALLAHABAD
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
