What is the time and space complexities of merge sort and when is it preferred over quick sort?
- 0 Answers
- 682 Views
- Amazon, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
let's take a code struct FAQ { int a; char b; float c; double d; int a[10]; }*temp; now explain me how the memory will be allocated for the structure FAQ and what address will be in the structure pointer (temp)....................
6)What would be the output? main() { int u=1,v=3; pf("%d%d",u,v); funct1(&u,&v); pf("%d%d\n",u,v); } void funct1(int *pu, int *pv) { *pu=0; *pv=0; return; } a)1 3 1 3 b)1 3 1 1 c)1 3 0 0 d)1 1 1 1 e) 3 1 3 1
Can we change the value of constant variable in c?
What is an expression?
What are data structures in c and how to use them?
What are the benefits of c language?
In a byte, what is the maximum decimal number that you can accommodate?
Do pointers need to be initialized?
How many levels of indirection in pointers can you have in a single declaration?
0 Answers Agilent, ZS Associates,
can anyone suggest some site name..where i can get some good data structure puzzles???
How does C++ help with the tradeoff of safety vs. usability?
what is volatile in c language?
9 Answers Cap Gemini, HCL, Honeywell, TCS, Tech Mahindra,
C 
