Answer Posted / om

There are two good method to solve this problem; first one
takes 2n-3 comparison and second one takes n+lg(n)-2
comparison only.

1) Run bubble sort loop only for 2 times ..the first time it
will do n-1 comparison and put the largest element at the
end of the array.... then by running second time it will do
n-2 comparison and put the second largest element at the
second last position in the array... so n-1 + n-2 =2n-3
comparison. cool naa... I didn't sort the whole array and
found the second largest element.

2)http://www.seeingwithc.org/topic3html.html
check this site...

How to write a code for reverse of string without using string functions?

2158

---

FORMATTED INPUT/OUTPUT functions are a) scanf() and printf() b) gets() and puts() c) getchar() and putchar() d) all the above

1128

---

Describe the header file and its usage in c programming?

1081

---

What does %p mean c?

1083

---

What is main () in c?

1083

---

How can I invoke another program or command and trap its output?

1108

---

Compare interpreters and compilers.

1076

---

What is getch c?

1311

---

What is C language ?

1976

---

What is the use of pragma in embedded c?

1063

---

List the different types of c tokens?

1079

---

What is a stream water?

1235

---

What are the advantages and disadvantages of c language?

1023

---

Which driver is a pure java driver

1632

---

Are the variables argc and argv are local to main?

1326

---