Hello,
I sent you some documents earlier.
Kindly have look at rest of these documents
https://googledrive.com/host/0B6h--alFAgSKTzN4T2Jtalh4Tk0
Your response would be much appreciated as I am expecting for a quick reply.
Thank you and best regards,
--
vijay goswami
--
You received
countNodeAtEachLevel(node * T, int a[],int level)
{
if(T!=NULL){
a[level]+=1;
countNodeAtEachLevel(T-left,a,level+1);
countNodeAtEachLeve(T-right,a,level+1);
}
}
The function is called with initial values
countNodeAtEachLevel(Root,a,0);
it reduces the size of the source file
On Mon, Aug 8, 2011 at 4:18 PM, sourabh jakhar sourabhjak...@gmail.comwrote:
b
On Mon, Aug 8, 2011 at 4:18 PM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
Which is not an advantage of using subroutines?
(a) Easier maintenance
(b) Runtime
run bubble sort for m passes
On Mon, Aug 8, 2011 at 4:02 PM, Nitin Nizhawan nitin.nizha...@gmail.comwrote:
Selection algorithm, http://en.wikipedia.org/wiki/Selection_algorithm
On Mon, Aug 8, 2011 at 3:59 PM, nick tarunguptaa...@gmail.com wrote:
how will you find the m'th maximum element
its an infinite loop
On Tue, Aug 2, 2011 at 12:21 AM, jagrati verma
jagrativermamn...@gmail.comwrote:
#includestdio.h
main()
{
short int i=0;
for(i=5 i=-1;++i;i0)
printf(%u\n,i);
printf(\n);
return 0;
}
o/p is 1.
int mypow(int x,int m)
{
if(m==0)
return 1;
if(m==1)
return x;
return mypow(x,ceil((float)m/2))*mypow(x,m/2);
}
On Sat, Jul 30, 2011 at 1:02 PM, arvind kumar arvindk...@gmail.com wrote:
Find the least time complexity algorithm(most efficient algo) to find
x^m(x to
the answer is 144 she-calves..the qn asks for calves, not cows and
calves..in all there are 233 cows n calves where there are 144 calves n 89
cows
On Sun, Jul 31, 2011 at 2:02 PM, Shubham Maheshwari
shubham@gmail.comwrote:
for the cows ques ... you all are forgetting to add the orginal
