[algogeeks] C# ebook
Hi Anybody do u have c# ebook please send on group thanks -- 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] Request for crack coding book ebook
hi anybody do you have CrackCoding ebook pls send . thanks -- 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] Remove all Duplicates Words
Qn. Remove all duplicates words from given a line without using extra memory ? Ex:-Hello word hello hi Out put:- Hello word hi -- 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] Amazon Question
Order would be O(m*n)... On Wed, Aug 3, 2011 at 4:01 AM, ankit sambyal ankitsamb...@gmail.comwrote: Given two lists write a function which returns a list which is the intersection of the two lists.the original lists should remain same. (Intersection - if first list is say,1,20 3,45 and second list is 3,24 ,45,90,68 then intersection should be 3,45 ) -- 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] Amazon telephone interview
Are U freshers and How would U scheduled Interview 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.
[algogeeks] Nagarro Coding Round Ques......
Using the all characters of a given String how to specify either a palindrome or not. Ex:- 1) String=teste After arrange all character we can made a palindrome String as teset So output is TRUE. 2)String=hello we can not made a palindrome String output is FALSE bool IspalindromePossible (String str) { } Thanks -- 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] Adove Question.........
Hi Given an array of size N that contain some elements, Write a program for finding all possible subset of size R . n i.e. P r Array :[1,2,3,4] n=4,r=3; Output should be: {1,2,3},(1,2,4).{2,3,4},{...} possible 24 sets. Thanks -- 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] Adove Question.........
yes R is actually size of subset that is always less than or equal to Size of the Array i.e r=n On Thu, Jul 21, 2011 at 11:16 PM, Puneet Gautam puneet.nsi...@gmail.comwrote: @umesh: can R take any value from 1 to 3..? On 7/22/11, UMESH KUMAR kumar.umesh...@gmail.com wrote: Hi Given an array of size N that contain some elements, Write a program for finding all possible subset of size R . n i.e. P r Array :[1,2,3,4] n=4,r=3; Output should be: {1,2,3},(1,2,4).{2,3,4},{...} possible 24 sets. Thanks -- 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] Coding..........
Anybody try for maintain the stable of elements in O(n) as like Input is :{1,2,3,4,5,6,7} then Output should be (2,4,6,1,3,5,7) not.. {2,4,6,1,5,3,7} base on above discussion .. -- 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] Coding..........
Hi Given an array A[], write a function to separate even and odd numbers (i.e., put all even numbers first than odd numbers) and stability is also maintain for the elements in the Array. Eg. input: A[] = {12, 34, 45, 9, 8, 90, 3} output: A[] = {12, 34, 8, 90, 45, 9, 3}** Thanks -- 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] Coding Ques..............
Hi Given an array how to find a sequence whose sum is maximum *but condition is that no two adjacent elements* of the given Array. ex:- Array:-[3,6,7,10,4] output:- {6,10}=16 Array::[12,3,5,30] output:-{12,30}= 42 -- 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] Re: Coding Ques..............
Hi @Somnath my question is some different if given array :3,2,7,10 So according to last discussion Only Out put is *13 *not the show elements Output :: {3,10} So basically my question is that how to pick all elements that return max sum Thanks.. -- 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] C OUTPUT HELP
void call(int a,int b,int c) { printf(%d %d %d,a,b,c); } int main() { int a=5; call(a++,a++,++a); return 0; } On Sat, Jun 11, 2011 at 8:21 PM, PRAMENDRA RATHi rathi prathi...@gmail.com wrote: IN second program: in function value are always push in the stack from right. so first value is --i that will make i=1 and value 1 will be passed to function and after that i++ that's means i will be passed. so 1 will be passed and after passing value. i will changed to 2. if u want to know why reverse order than can go through: http://cs.nyu.edu/courses/fall03/V22.0201-003/c_param.htmlhttp://www.google.com/url?sa=Dq=http://cs.nyu.edu/courses/fall03/V22.0201-003/c_param.html - PRAMENDRA RATHI NIT ALLAHABAD When the function is called then formal values PUSH in a STACK from left to right and POP from left to right finally so we can obtained the output :7 6 6 ... Since function call -- * call(a++,a++,++a);* * and *a=5 STACK PUSH AS:- 0::++a c 1::a++ b 2::a++ a POP AS: 0::++a c= 6 ( *6)* * * * *1::a++ b = 6 (*7*) 2::a++ a = 7 (*8*) So. finally OUTPUT :- * a=7, b=6, c=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.
[algogeeks] Stroustrup C++ BOOK
hi. Do you have anybody C++ by Stroustrup e-book please send on group. Thanks and Regards Umesh kumar -- 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] Stroustrup C++ BOOK
If you know link for that book please send for direct Download On Sat, Apr 23, 2011 at 6:57 AM, D.N.Vishwakarma@IITR deok...@gmail.comwrote: *Book can't be send to group as it is more than 4.0 mb . and group can't have massage more than 4.0 mb * On Sat, Apr 23, 2011 at 7:01 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote: hi. Do you have anybody C++ by Stroustrup e-book please send on group. Thanks and Regards Umesh kumar -- 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. -- **With Regards Deoki Nandan Vishwakarma IITR MCA Mathematics Department* * -- 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] Link list Problem
Are you sure that node is not exit in Link list and also memory is free? On Sun, Mar 13, 2011 at 9:57 AM, abhijith reddy abhijith200...@gmail.comwrote: copy data from the next node and then delete that next node. Say you need to delete 3 1 - 2 - 3 - 4 - 5 1 - 2 - 4 - 4 - 5 * Now delete node which is next to '*'. On Sun, Mar 13, 2011 at 10:23 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote: hi Given a singly Link list but Head of the List is unknown so my question is that How to delete a given node from the List??? -- 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.
[algogeeks] Link list Problem
hi Given a singly Link list but Head of the List is unknown so my question is that How to delete a given node from the List??? -- 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] Print Hello infinite..................
How to print Hello Infinite times without using Loop and Recursion function ? -- 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] NEED JSP EBOOK....
Hello Everybody I need right now JSP E-book . So, Everybody do u have good JSP please send on Group . Thanks and Regards Umesh Kumar D.U. -- 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] Coding question.............
hello... QN :- How to find *TRANSPOSE* of the *RECTANGULAR* matrix i,e. m * n , where n != m. Ex:- input:- 1 2 3 4 5 6 7 8 output:- 1 5 2 6 3 7 4 8 thanks and regards UMESH KUMAR D.U. -- 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] NAGARRO CODING QUES............
hello.. Qs:- Given an Array of contain elements range from 1 to 9 find all possible subsets and print all subsets whose sum is 10, Assume all elements in the array are distinct. Exa:- input:---{1,2,6,3,4}; Output:- {4,6}, {1,6,3}, {1,2,3,4} input :-{9,8,7,6}; output:- No Thanks And Regards Umesh Kumar -- 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] Explain anybody solution of Soduo Game is unique or Not......
Hello.. Explain and write Algorithm for* Soduo Game* and also describe Solution is unique or Not. if Anybody do you have C/C++ code please send to me. Thanks and Regards Umesh kumar -- 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] C output... ???
#define SIZE 10 int main() { int arr[SIZE]; printf(size of array is:%d\n,sizeof(arr)); return 0; } when we call the function and pass the name of the ARRAY ,then PUSH the base Address of the ARRAY in the Stack of the Calling Function not PUSH the entire ARRAY ,SO Desire Out_Put is Only Size of Pointer Not Size of Entire ARRAY . OUTPUT IS 4. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] tricky C aps ques
main() { int a[5]={1,3,6,7,0}; int *b; b=a[2]; coutb[-1]; } the value of b[-1] is a.1 b.3 c.-6 d.none ANS will be 3. Because Compiler internally first converted in the form as *(b-1) , and get the one position back at the position 3. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] HAPPY DIWALI FOR ALL...............
http://topwebdownloads.com/wp-content/uploads/2009/10/diwali-greetings-2.gif -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Addition Of numbers in SLL
On Sat, Aug 14, 2010 at 12:52 PM, AlgoBoy manjunath.n...@gmail.com wrote: Add two numbers represented in a SLL. Each digit is represented as a node...the length of the lists may be more than 2000... Wat is the most efficient soln...store the added digits in another SLL...and return the head as the answer :::two numbers are the seperate link list numbers or the same list that has to been add??? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@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] Back tracking in list
explain ,if anybody known how to back tracking a Singly link list as a Doubly list with XOR -operation or any method if implementation of a Doubly link list using only one pointer . Explain with help of example -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Singly to doubly....
How to convert Singly link list to Doubly link list without converting the Structure of the list ,so possible or not if possible then explain soon. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Diff b\w BST and binary tree............
what is the main difference b/w BST and Binary tree for the purpose of implementation . and what is the Data structure of that. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] what Garbase value.........
What is the Garbase value in C/C++ and what is the Null pointer ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Permutation.................
Write a C code for generate all possible Permutation as:- 1 2 3 Total no. of Per=6 also print all permutation as:- 1 2 3 1 3 2 2 1 3 2 3 1 3 1 2 3 2 1 if inpute is 1 2 3 2 total no of permutation = 12 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Permutation.................
On Sun, Aug 1, 2010 at 5:20 PM, Pramod Negi negi.1...@gmail.com wrote: http://pramnegi.blogspot.com/2009/11/dons-permutaion.html Thanks Pramod Negi On Sun, Aug 1, 2010 at 4:30 PM, UMESH KUMAR kumar.umesh...@gmail.comwrote: Write a C code for generate all possible Permutation as:- 1 2 3 Total no. of Per=6 also print all permutation as:- 1 2 3 1 3 2 2 1 3 2 3 1 3 1 2 3 2 1 if inpute is 1 2 3 2 total no of permutation = 12 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. Thanks a lot sirjee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Interview Nagarro.................
Hello everybady, my question is:- Find the maximum length Subsequence in the given Array that contains only 0's and 1's elements and condition is that number of 1;s equal to the number of 0's. Ex:- Input:- 10101011100 output:-101010111000 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] interview microsoft............
Qn:-in the given array elements a1a2a3a4..anb1b2b3b4...bnc1c2c3c4cn without take a extra memory how to merge just like? a1b1c1a2b2c2a3b3c3anbncn -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Time complexity................
Hello . How to decide insertion sort takes less cost of time for small input size. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] C++++
Hello everybody how to Assign Constant value in Class of C++ Describe : Private,Protected, and Public Area in C++. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] HIEGHT
* find height of BINARY tree ITERATIVELY??* //** * Algorithm:-* First create a STACK of Apropriate Size of Bnode pointer type and perform a PUSH operation (Starting from Root of the Tree) ,and then inceament one in the Level of the Tree and as root=root-left until we get NULL. if we get NULL ,check that TOP 0 if TOP 0 then break ,Because Stack is Empty,Otherwise if encreamented Level more than currently Height then Height=Level. perform POP Operation from the Stack and store in Root. if Root-right does note exit then Decreament one from the level and finaly Root=Root-right. *Just a C -code *:- int height(struct bnode* root) { int top=heigh=lev= -1 bnode *stack[MAX] while(1) { while(root) { if(topMAX-1) { print-Stack is full break } stack[++top]=root // PUSH in Stack lev ++ root=root-left } if(top0) break; if(heighlev) heigh=lev root=stack[top--] //Stack is POP if(root-right==NULL) lev -- root=root-right } return height; } Umesh kumar MCA from University of Delhi. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] C PROCEDURAL LANGUAGE ?
On Fri, Jul 9, 2010 at 3:50 AM, RIDER mohit...@gmail.com wrote: if c is procedural language then why declaring variable any where works by gcc compiler?according to procedural property declaration should only be at top ? void main(){ int c=1; printf(%d,c); int d=5; printf(%d,d); return; } why this work in c? //** C is a procedural language but implementation depends on Compiler to Compiler ,some specific case as in Loop declaration not allow in prantheshes .. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@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] shift operators
On Sun, Jul 4, 2010 at 9:07 PM, jalaj jaiswal jalaj.jaiswa...@gmail.comwrote: how do we perform left shift and right shift on negative numbers.. for eg -13 if negative number is shifted left () then vacent space is filled by 0's and right sift () then vacents space is filled by sign bits ex: -4 binary== 1 100 -42 after left shift 1 1 -16 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] microsoft
On Sun, Jun 27, 2010 at 1:57 AM, jalaj jaiswal jalaj.jaiswa...@gmail.comwrote: Given an array of integers, {1,0,2,0,3,0,0,4,5,6,7,0,0,0}, you have to create a new array which will be like (1,2,3,4,5,6,7,0,0,0,0,0,0,0}, without using any other temporary array. //** Algorithm:- int i,k; i=k=0; int ar[]={ 1,0,2,0,3,0,0,4,5,6,7,0,0,0}; for - i to sizeofArray-1 { if(ar[i] !=0) i++ else { k=i+1 while(ar[k] ==0) k++ swap ar[i] ar[k] i++ } } UMESH KUMAR PERSUING MCA FROM UNIVERSITY OF DELHI +919958120503 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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.