srinivasan106

Suppose we have two array inorder and preorder containing the elements in the said format. Using these two arrays how can i generate the binary tree?? Any help on the algorithm to be followed will be highly appreciated. For eg: inorder is : 2 3 4 5 6 7 8 …

is it possible to send an sms through JAVA.. My requirement is a chat application like Rediff bol. am able to do chat using networks. but can i be able to send sms. just like when i press a button called send sms then a window needs to get a …

[CODE] for(i=0;i<n-1;i++) { for(j=i+1;j<n;j++) { if(a[i]>a[j]) { temp=a[i]; a[i]=a[j]; a[j]=temp; count++; } } } [/CODE] [CODE] void select(int a[],int n) { for(i=0;i<=n;i++) { k=i; min=a[i]; for(j=i+1;j<=n-1;j++) { if(a[j]<min) { min=a[j]; k=j; count++; } else count++; } a[k]=a[i]; a[i]=min; } } [/CODE] which one is selection sort???first or sec??

wat is the concept beyond COLUMN SORT??.. can any body guide me...Y column sort is introduced??

Hi all! Please give c code which finds the included header files of another c file

write a problem that take 10 integers from the user put in a table then calculate the min,max and the average and print it on the screen

[B]this program is to find maximum and minimum using divide and conquer technique[/B] [CODE=C]int min=32000,max=0; void maxi(int [],int,int),merge(int [],int,int,int,int); void main() { int a[30],n,i; printf("enter the limit\n"); scanf("%d",&n); printf("enter the aray elements\n"); for(i=0;i<n;i++) scanf("%d",&a[i]); maxi(a,0,n-1); printf("maximum is %d and minimum is %d\n",max,min); getch(); } void maxi(int a[],int first,int last) { …

This may really simple to most people on here but i'm going crazy trying to work it out. I was set a task by someone to write a bit of code in C to do the following: 1) Ask Operator to enter 2 things - a letter of the alphabet, …