Answer Posted / prof.gagandeep jagdev

Quick Sort, Since the array is already sorted, so this can
be considered as Best case example. The complexity of quick
sort in best case is O(n log n). No doubt , same is the
complexity of Merge sort in best case, but Quick sort
enjoys priority over Merge Sort because Merge sort requires
extra memory( an array) to store the sorted result whereas
quick sort do not specify any such need.

Why array is used in c?

1016

---

please can any one suggest me best useful video tutorials on c i am science graduate.please help me.u can email me to sas29@in.com

1777

---

What is property type c?

1092

---

What is the value of c?

1068

---

void main(){ int a; a=1; while(a-->=1) while(a-->=0); printf("%d",a); }

1727

---

A variable that is defined in a specified portion of a program but can be used throughout the program a) global variable b) local variable c) character d) none

1249

---

What is the use of static variable in c?

1091

---

How can I send mail from within a c program?

1034

---

When should the register modifier be used? Does it really help?

970

---

What are the uses of a pointer?

1153

---

What is huge pointer in c?

1089

---

Why string is used in c?

1009

---

Why do we use stdio h and conio h?

1093

---

What is the maximum no. of arguments that can be given in a command line in C.?

1154

---

Can we increase size of array in c?

971

---