Answer Posted / abhinav

call this recursive routine:

void pascal(int n)
{
if(n==1) {
printf("%d \n", n);
return;
}
pascal(n-1);
int i;
for(i=1;i<=n; i++)
printf("%d ",i);
for(i=n-1;i>=1; i--)
printf("%d ",i);
printf("\n");
}

What is c value paradox explain?

1101

---

What are the benefits of c language?

1183

---

Write a program to reverse a linked list in c.

1137

---

How can I do graphics in c?

1035

---

7-Given an index k, return the kth row of the Pascal's triangle. For example, when k = 3, the row is [1,3,3,1]. For reference look at the following standard pascal’s triangle.

2761

---

What is the use of ?

1043

---

There seem to be a few missing operators ..

1052

---

Is there sort function in c?

1023

---

Why is python slower than c?

1094

---

What is array in c with example?

1276

---

What is the advantage of c?

1132

---

i want to know the procedure of qualcomm for getting a job through offcampus

2472

---

How can I find out the size of a file, prior to reading it in?

1180

---

The process of repeatedly running a set of computer instructions until some condition is specifed a) condition b) sequential condition c) global d) iteration

1103

---

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

1092

---