Steps:
1) hashmapping and to keep track of value with its count..
2)now put these elements in 2D array...m[r][2].r - number of different
elements...
1st
col...have... the value..
2nd col...have ..the frequency..
3) Now
I think we have to use reservoir sampling here.
On Dec 17 2011, 10:20 am, Ankur Garg ankurga...@gmail.com wrote:
suggest algo to find k most frequently occuring numbers from a file of very
large size containing numbers.
--
You received this message because you are subscribed to the Google
Let a color below represent a single character in UTF-8 encoding ,
which means that each color can span multiple bytes , In example below I
denote one byte by one english character . i.e.
'a' or 'b' or 'c' ,etc. below takes one byte :
Let the string is :
x abc def gh ij klmn
now to reverse this
Awesome!!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/RsqwEYjbA3kJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
Awesome Explanation Lucifer!!
On Wednesday, January 11, 2012 10:25:01 PM UTC+5:30, Lucifer wrote:
@Ankur..
I will try to explain the approach with an example..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on
These may be of interest as well:
http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=5045582
https://webcache.googleusercontent.com/search?q=cache:onpOivQX668J:googleresearch.blogspot.com/2006/06/extra-extra-read-all-about-it-nearly.html+cd=1hl=enct=clnkclient=ubuntu
On Sunday, January 8, 2012
