What is the most efficient way, memory-wise, to store 1 million phone
numbers?
--
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
if u have known the answer u would have probably answered rather than
writing this thing..:|
On Jun 29, 5:40 pm, shady sinv...@gmail.com wrote:
go through the archives you will definitely find the answer :)
On Wed, Jun 29, 2011 at 6:05 PM, MONSIEUR monsieur@gmail.com wrote:
What
wrote:
@MONSIEUR Use Binary Search Tree as the data Structure to store the values
for the Phone numbers because insertion and deletion is easy plus you will
get the additional advantage of sorted list of phone numbers . So Binary
search tree is better than using hash data structure
trie uses more space
On Jun 29, 5:52 pm, sudheer kumar chigullapallysudh...@gmail.com
wrote:
USE TRIE
On Wed, Jun 29, 2011 at 6:10 PM, shady sinv...@gmail.com wrote:
go through the archives you will definitely find the answer :)
On Wed, Jun 29, 2011 at 6:05 PM, MONSIEUR monsieur
@DK: absolutely..actually mutex is a kinda semaphore...and unlike
semaphores it does not have any list(of waiting processes) associated
with it and just is a kind of lock and key model with no waiting
Q.someone can say that they are Binary semaphore since binary
semaphore have only two values
@piyush: excellent buddybtw what was the initial
spark...???.:-)
On May 21, 1:01 pm, Piyush Sinha ecstasy.piy...@gmail.com wrote:
@Amit JaspalThe algo given by me works for the given case..check it
On 5/20/11, Anurag Bhatia abhati...@gmail.com wrote:
Just need some
guys why cant we simply sort bins using merge sort or any comparison
sort and then use binary search to find out the first available
bin.t(n)=O(nlgn)+n*(lgn)=O(nlgn).
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Given: An array of integers(may be both positive and negative), we
have to find out the minimum positive sum of array(not necessarily
continuous).
example:- {1,-5,7,10,-14,16,-17,20,21,22}
here answer is -5,-17,22 having sum=0;
--
You received this message because you are subscribed
@jalaj: text missing.??? I think i've mentioned question
properly.is there any thing more u require?
n Feb 9, 9:45 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote:
@monsieur ... text missing dude
On Wed, Feb 9, 2011 at 10:12 PM, MONSIEUR monsieur@gmail.com wrote:
Given
@apaza: brute force.checking all combinations(with at least one
negative number,if any)..too hard buddy.
On Feb 9, 10:07 pm, Rel Guzman Apaza rgap...@gmail.com wrote:
I think the only solution will be finding all subsets.
2011/2/9 MONSIEUR monsieur@gmail.com
@jalaj: text
that is by selecting zero no of elements ??
On Wed, Feb 9, 2011 at 10:37 PM, Rel Guzman Apaza rgap...@gmail.com wrote:
I think the only solution will be finding all subsets.
2011/2/9 MONSIEUR monsieur@gmail.com
@jalaj: text missing.??? I think i've mentioned question
properly
11 matches
Mail list logo
