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...

Can you please compare array with pointer?

1152

---

What is quick sort in c?

1155

---

What is array of structure in c?

1252

---

Why does everyone say not to use gets?

1198

---

Write a program in "C" to calculate the root of a quadratic equation ax^2+bx+c=0, where the value of a,b & c are known.

2281

---

What is optimization in c?

1070

---

Why is c not oop?

1038

---

Write a program to print “hello world” without using semicolon?

1179

---

What does p mean in physics?

1095

---

What are the __date__ and __time__ preprocessor commands?

1172

---

What are the advantages of c language?

1148

---

Explain high-order bytes.

1178

---

Write a program to check palindrome number in c programming?

1063

---

What is static function in c?

1166

---

Why doesnt long int work?

1099

---