Re: [algogeeks] Suggest algo...
it can be done with O(N * S) time complexity. where N = number of digits S = sum intilize : input[1][j]=0 1<=j <= S input[j][0]=1 0<=j<=N now fill table using following recurrence :- input[i][j] = input[i-1][j] or input[i-1][j-input[i]]; now after creating table...check if input[N][S] == 1 if no then sum cannot be created or if yes , find all combination recursively by first not considering input[i] as part of the subset then considering input[i] as a part of the subset. On Sat, Aug 25, 2012 at 12:34 AM, amrit harry wrote: > find the all possible combination of digits ranging 1 to 9 whose sum is > 10, > no digit shud be repeated in any combination. > 1234 > 127 > 136 > 145 > 19 > 235 > 28 > 37 > 46 > > -- > 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/-/K9atBSG79wQJ. > 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.
Re: [algogeeks] Suggest algo...
Code:-
#include
#include
using namespace std;
void recursion(int sum,int i,vector v,int size)
{
vector v1=v;
int size1=size;
if(sum==0)
{
for(int k=0;k v;
recursion(10,0,v,size);
system("pause");
}
output:-1 2 3 4
1 2 7
1 3 6
1 4 5
1 9
2 3 5
2 8
3 7
4 6
--
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.
Re: [algogeeks] Suggest algo...
keep a hash to check if digit is already used for that combination or not. add this logic to existing combinations generator code. On Sat, Aug 25, 2012 at 12:34 AM, amrit harry wrote: > find the all possible combination of digits ranging 1 to 9 whose sum is > 10, > no digit shud be repeated in any combination. > 1234 > 127 > 136 > 145 > 19 > 235 > 28 > 37 > 46 > > -- > 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/-/K9atBSG79wQJ. > 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. > -- *Regards *Ravi Maggon Member Technical - IT/Front Office D.E. Shaw & Co. -- 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.
[algogeeks] Suggest algo...
find the all possible combination of digits ranging 1 to 9 whose sum is 10, no digit shud be repeated in any combination. 1234 127 136 145 19 235 28 37 46 -- 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/-/K9atBSG79wQJ. 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.
Re: [algogeeks] suggest algo
Hi, sorry i mis-understood the problem ll check and submit asap.. -- 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.
Re: [algogeeks] suggest algo
Hi,
1.find the sum of the digits of the number
[acc. to fact that number+9 has the same sum of the digits as number]
2. for i=sum_of_the_digits_of_the_number; i<=number; i=i+9
3.find if number is divisible by i then print it
code:
#include
int sum_of_the_digits(int n)
{
if(n==0)
return 0;
return (n%10 + sum_of_the_digits(n/10));
}
int main()
{
int a;
printf("Enter the number:");
scanf("%d",&a);
int i;
for(i=sum_of_the_digits(a);i<=a;i+=9)
if(a%i==0)
{
printf("%d",i);
break;
}
return 0;
}
Regards,
Karthikeyan.V.B
PSGTECH
CBE
--
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.
[algogeeks] suggest algo
For the given number n find the minimal positive integer divisable by n, with the sum of digits equal to n. -- 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.
Re: [algogeeks] suggest algo
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 run the randomized partition...and find (n-k)th smallest according to frequency.take k elements... below it...have most frequent elements PRAVEEN RAJ DELHI COLLEGE OF ENGINEERING -- 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.
Re: [algogeeks] suggest algo
@shashank: sorting the hashed values is more intensive than using the heap with size K. (as k< N log N using heap --> N log k also, i just read about the splay trees.. this can improve the performance of 'N log N factor' right when used on input, though it can be used on a heap as well too, esp *when there are few frequent & many infrequent.* is my understanding of splay trees correct? (the underlined part) -- 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/-/RRXDiXhNEuEJ. 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.
Re: [algogeeks] suggest algo
@Shashank: i not sure if splay tree would always return k most frequent elements . if we want to find k most frequent elements then doing level order traversal and finding first k elements may not return k most frequent elements bcoz say if number 5 comes for the 1st time , now 5 will be the root of the tree now if we do level order traversal it print first k elements it will include number 5 which has frequency of 1. On Wed, Dec 21, 2011 at 7:15 PM, WgpShashank wrote: > @atul approach sounds good but we have to check for each time counts > updated isn't it , though even can sort the hash table & return top k > number . > also as i know we have splay tree , even google uses it , to get most > frequent item . > > > Thanks > Shashank. > > -- > 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/-/gucYTW56cCsJ. > > 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.
Re: [algogeeks] suggest algo
@Shashank: well i guess there is one more issue with my algo. if counter is updated for say number 3. and heap has already node with value 3 and count 2. now root could be node with value 5 and count 1. if i remove root from the heap, then heap will be havingi will be having 2 node with value 3 with count 3 and 2. On Wed, Dec 21, 2011 at 7:15 PM, WgpShashank wrote: > @atul approach sounds good but we have to check for each time counts > updated isn't it , though even can sort the hash table & return top k > number . > also as i know we have splay tree , even google uses it , to get most > frequent item . > > > Thanks > Shashank. > > -- > 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/-/gucYTW56cCsJ. > > 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.
Re: [algogeeks] suggest algo
@atul approach sounds good but we have to check for each time counts updated isn't it , though even can sort the hash table & return top k number . also as i know we have splay tree , even google uses it , to get most frequent item . Thanks Shashank. -- 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/-/gucYTW56cCsJ. 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.
Re: [algogeeks] suggest algo
@Karthikeyan : i have little doubt in you algorithm... acc to the question input stream is the stream of numbers not words. now if we consider Trie , first you have to extract digits from each input number and use those digit to created trie. so how will you get k most frequent occurring words in O(n) ??? On Sat, Dec 17, 2011 at 11:38 PM, Karthikeyan V.B wrote: > Trie data structure can be used... > > In the trie, you can record item count in each node representing frequency > of word consisting of characters on the path from root to current node. > > The time complexity to setup the trie is O(Ln) (where L is number of > characters in the longest item). To find the top k items, we can traversal > the trie, which also costs O(n). So it takes O(n) to solve this problem. > > > > Regards, > > KARTHIKEYAN.V.B > > PSGTECH > > CBE > > -- > 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.
Re: [algogeeks] suggest algo
we can use hashtable to maintain count of each number coming from the file. now make a MIN heap of size K now every time a count is updated in the hastable , compare it with the root of the Min heap. if root of heap is smaller then replace it with new greater count and then heapify again. In the end you will be having k most frequent numbers. On Sat, Dec 17, 2011 at 8:50 PM, Ankur Garg 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 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.
Re: [algogeeks] suggest algo
Trie data structure can be used... In the trie, you can record item count in each node representing frequency of word consisting of characters on the path from root to current node. The time complexity to setup the trie is O(Ln) (where L is number of characters in the longest item). To find the top k items, we can traversal the trie, which also costs O(n). So it takes O(n) to solve this problem. Regards, KARTHIKEYAN.V.B PSGTECH CBE -- 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.
[algogeeks] suggest algo
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 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.
Re: [algogeeks] Suggest Algo for this Question
@gaurav : you need to first build heap and then maintain heap property ever time you remove element.so this would take O(n logn ). On Wed, Dec 14, 2011 at 1:38 AM, Gaurav Kumar wrote: > Why can't we keep removing the minimum element each time and compare it > with x? This should take O(k) time since in a Min heap, the minimum element > can be removed in O(1) time? Am I missing something? > > > On Tue, Dec 13, 2011 at 8:43 AM, atul anand wrote: > >> O(k) in the worst-case , then i guess it would better to use >> median-of median algo to find element at rank k. and comparing with x. >> >> or >> we can us hashtable to solve this. >> >> On Tue, Dec 13, 2011 at 3:23 PM, Ankur Garg wrote: >> >>> Given an array-based heap on n elements and a real number x, efficiently >>> determine whether the kth smallest element in the heap is greater than or >>> equal to x. Your algorithm should be O(k) in the worst-case, independent of >>> the size of the heap. >>> >>> >>> This question was also asked in Amazon >>> >>> -- >>> 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. >> > > -- > 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.
Re: [algogeeks] Suggest Algo for this Question
Why can't we keep removing the minimum element each time and compare it with x? This should take O(k) time since in a Min heap, the minimum element can be removed in O(1) time? Am I missing something? On Tue, Dec 13, 2011 at 8:43 AM, atul anand wrote: > O(k) in the worst-case , then i guess it would better to use > median-of median algo to find element at rank k. and comparing with x. > > or > we can us hashtable to solve this. > > On Tue, Dec 13, 2011 at 3:23 PM, Ankur Garg wrote: > >> Given an array-based heap on n elements and a real number x, efficiently >> determine whether the kth smallest element in the heap is greater than or >> equal to x. Your algorithm should be O(k) in the worst-case, independent of >> the size of the heap. >> >> >> This question was also asked in Amazon >> >> -- >> 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. > -- 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.
Re: [algogeeks] Suggest Algo for this Question
O(k) in the worst-case , then i guess it would better to use median-of median algo to find element at rank k. and comparing with x. or we can us hashtable to solve this. On Tue, Dec 13, 2011 at 3:23 PM, Ankur Garg wrote: > Given an array-based heap on n elements and a real number x, efficiently > determine whether the kth smallest element in the heap is greater than or > equal to x. Your algorithm should be O(k) in the worst-case, independent of > the size of the heap. > > > This question was also asked in Amazon > > -- > 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.
[algogeeks] Suggest Algo for this Question
Given an array-based heap on n elements and a real number x, efficiently determine whether the kth smallest element in the heap is greater than or equal to x. Your algorithm should be O(k) in the worst-case, independent of the size of the heap. This question was also asked in Amazon -- 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.
Re: [algogeeks] Suggest Algo: OffCampus Apple Interview Question
One approach could be using the file. Say x = 50 %, so every alternate run, the output should be true. 1. First run, store 0.5 in the file 2. Second run, add 0.5 to the previous value 3. Check if the sum is 1.d where 0 <= d < 1, return true and store 0.d in the file We can extend the same logic for any value of x. -- Pankaj On Wed, Nov 30, 2011 at 12:45 PM, atul anand wrote: > @nitin : as mentioned in the subject , its for Apple > > BTW @siddharth , i did not understand your question . little more > explanation please. > > On Mon, Nov 28, 2011 at 7:14 PM, Nitin Garg wrote: > >> Please clarify. Also tell offcampus interview for which company? >> >> >> On Mon, Nov 28, 2011 at 7:10 PM, Siddharth Pipriya wrote: >> >>> write a program that takes as input a number x and gives output true x >>> percent of the time it is run. >>> >>> -- >>> 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. >>> >>> >> >> >> -- >> Nitin Garg >> >> "Personality can open doors, but only Character can keep them open" >> >> -- >> 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. > -- 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.
Re: [algogeeks] Suggest Algo: OffCampus Apple Interview Question
@nitin : as mentioned in the subject , its for Apple BTW @siddharth , i did not understand your question . little more explanation please. On Mon, Nov 28, 2011 at 7:14 PM, Nitin Garg wrote: > Please clarify. Also tell offcampus interview for which company? > > > On Mon, Nov 28, 2011 at 7:10 PM, Siddharth Pipriya wrote: > >> write a program that takes as input a number x and gives output true x >> percent of the time it is run. >> >> -- >> 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. >> >> > > > -- > Nitin Garg > > "Personality can open doors, but only Character can keep them open" > > -- > 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.
Re: [algogeeks] Suggest Algo: OffCampus Apple Interview Question
Please clarify. Also tell offcampus interview for which company? On Mon, Nov 28, 2011 at 7:10 PM, Siddharth Pipriya wrote: > write a program that takes as input a number x and gives output true x > percent of the time it is run. > > -- > 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. > > -- Nitin Garg "Personality can open doors, but only Character can keep them open" -- 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.
[algogeeks] Suggest Algo: OffCampus Apple Interview Question
write a program that takes as input a number x and gives output true x percent of the time it is run. -- 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.
