Find the second largest element in an array with minimum no of comparisons and give the minimum no of comparisons needed on an array of size N to do the same.
No Answer is Posted For this Question
Be the First to Post Answer
Evaluate the following: int fn(int v) { if(v==1 || v==0) return 1; if(v%2==0) return fn(v/2)+2; else return fn(v-1)+3; } for fn(7); 1) 10 2) 11 3) 1
#include main() { enum _tag{ left=10, right, front=100, back}; printf("left is %d, right is %d, front is %d, back is %d",left,right,front,back); }
what is the difference between i++ and ++i?
Write a program on swapping (100, 50)
Is there any demerits of using pointer?
what is uses of .net
what is the output for the code : main() { int i,j; printf("%d %d ",scanf("%d%d",&i,&j)); }
A collection of data with a given structure for excepting storing and providing on demand data for multiple users a) linked list b) datastructer c) database d) preprocessor
Explain the properties of union. What is the size of a union variable
What is dangling pointer in c?
#include<stdio.h> { printf("Hello"); } how compile time affects when we add additional header file <conio.h>.
What are operators in c?