Answer Posted / code0090

for more go to
http://answerwale.co.cc/?p=22#comment-18

#include<stdio.h>
#include<conio.h>

int main()
{
int a=5;
int b=9;

while(a!=0){
for(int i=a;i>0;i--)
{
printf("%d",i);
}
printf("\n");
a--;
}
getch();
return 0;
}

List at least 10 sorting methods indicating their average case complexity, worst case complexity and best case complexity.

2796

---

Explain what are the different data types in c?

1266

---

What is s or c?

1121

---

What is maximum size of array in c?

1086

---

What are bitwise shift operators in c programming?

1135

---

What are the salient features of c languages?

1139

---

Explain the difference between getch() and getche() in c?

1051

---

What is nested structure in c?

1117

---

Explain the properties of union.

1135

---

what are bit fields? What is the use of bit fields in a structure declaration?

2202

---

What are the different file extensions involved when programming in C?

1342

---

What is #pragma statements?

1159

---

List the difference between a 'copy constructor' and a 'assignment operator' in C?

1141

---

I have a varargs function which accepts a float parameter?

1099

---

How does free() know explain how much memory to release?

1111

---