we can convert all rows in an equivalent integer and then sort all numbers and
for(int i=1;i<=n;i++)
{
if(sorted[i]==sorted[i-1])
prinf(sorted[i]);
}
On 6/28/11, sunny agrawal <sunny816.i...@gmail.com> wrote:
> @Ankit
> if N is large how will you hash the rows, numbers will be very large
> can you explain using given example ?
>
> On Tue, Jun 28, 2011 at 11:38 AM, Ankit Agrawal <
> ankitmnnit.agra...@gmail.com> wrote:
>
>> u can use hashing ...
>> hash fun can b "base2 to base10"
>>
>> --
>> 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.
>>
>
>
>
> --
> Sunny Aggrawal
> B-Tech IV year,CSI
> Indian Institute Of Technology,Roorkee
>
> --
> 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.
>
>
--
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.
