The performance of an operation in several steps with each step using the output of the preceding step
a) recursion
b) search
c) call by value
d) call by reference
No Answer is Posted For this Question
Be the First to Post Answer
Can you mix old-style and new-style function syntax?
If the size of int data type is two bytes, what is the range of signed int data type?
write a c program for print your name .but,your name may be small letter mean print a capital letter or your name may be capital letter mean print a small letter .example \\enter ur name : sankar The name is: SANKAR (or) enter your name:SAnkar The name is:saNKAR
What is the most efficient way to count the number of bits which are set in a value?
why should i select you?
Sir i need notes for structure,functions,pointers in c language can you help me please
size maximum allocated by calloc()
What is the acronym for ansi?
what is call by value and call by reference
What are the advantages and disadvantages of a heap?
What kind of sorting is this? SORT (k,n) 1.[Loop on I Index] repeat thru step2 for i=1,2,........n-1 2.[For each pass,get small value] min=i; repeat for j=i+1 to N do { if K[j]<k[min] min=j; } temp=K[i];K[i]=K[min];K[min]=temp; 3.[Sorted Values will be returned] A)Bubble Sort B)Quick Sort C)Selection Sort D)Merge Sort
main() { char *p; p="Hello"; printf("%c\n",*&*p); }