Answer Posted / foreverkushal

int SecondMax(int *Array, int ACount)
{
int Fm = 0, Sm = 0;
for (int i = 0; i < ACount; i++)
{
if (Array[i] > Sm)
{
if (Array[i] < Fm) Sm = Array[i];
else
{
Sm = Fm;
Fm = Array[i];
}
}
}
return Sm;
}

Would you rather wait for quicksort, linear search, or bubble sort on a 200000 element array? (Or go to lunch...) a) Quicksort b) Linear Search c) Bubble Sort

1006

---

What are the manipulators in c++?

990

---

Give example of a pure virtual function in c++?

1102

---

Where must the declaration of a friend function appear?

919

---

What is the arrow operator in c++?

960

---

List the special characteristics of constructor.

1136

---

Why do we use vector in c++?

1013

---

Write a program using display() function which takes two arguments.

1020

---

What is DlgProc?

983

---

Is c++ fully object oriented?

924

---

How do I run c++?

1015

---

Why do we use using namespace std in c++?

1032

---

Write down the equivalent pointer expression for referring the same element a[i][j][k][l]?

1208

---

Write a program to concatenate two strings.

1038

---

What will happen if a pointer is deleted twice?

1137

---