Answer / navs

if we take the array as
arr[]={1,4,7,2,10,0,6}

get the count

int count =6;
int max =arr[0];
int smax;

for (i=0;i<=count;i++)
{
if(max<arr[i])
{
smax=max;
max=max[i];
}
}

smax would give the second largest number

Answer / vili

// this deals with negative numbers as well
int getSecondMax( int* pArray, int nSize )
{
int nMax = pArray[0];
int n2ndMax = pArray[0];
for ( int i = 1; i < nSize; i++ )
{
if ( nMax < pArray[i] )
{
n2ndMax = nMax;
n2ndMax = pArray[i];
}
}
return n2ndMax;
}

What is c++ similar to?

0 Answers  

---

Show the application of a dynamic array with the help of an example.

0 Answers  

---

What would happen on forgetting [], while deallocating an array through new?

0 Answers  

---

Which uses less memory? a) struct astruct { int x; float y; int v; }; b) union aunion { int x; float v; }; c) char array[10];

4 Answers   Quark,

---

Should a constructor be public or private?

0 Answers  

---

Tell me what are static member functions?

0 Answers  

---

What is the best way to declare and define global variables?

0 Answers  

---

How do we balance an AVL Tree in C++?

0 Answers   Impetus,

---

How do you flush a buffer in c++?

0 Answers  

---

Given a simple program designed to take inputs of integers from 1-1000 and to output the factorial value of that number, how would you test this program? You do not have access to the code. Please be as specific as possible.

4 Answers   Microsoft,

---

What are proxy objects?

2 Answers  

---

When should we use multiple inheritance?

0 Answers  

---