Function to find second largest element of array

Some interviewers ask the question - write a program to find second largest/smallest element of the array. Then they add do it in single iteration.

No need to fret.

Initialize largest with 0th element of the array
Iterate over 1st element to nth element

If array element is >largest

set second_largest to largest
set largest to array element

But the question is what do we initialize the second largest element to. We know from experience that 0 is not the solution. Because some or all elements could be negative.

So let us initialize largest with 0th element of the array and also second largest with 0th element of the array.

So here is our code

 int second_largest(int *arr,int n)  
 {  
   int lar,sec_lar=0;int i;  
   lar = sec_lar= arr[0];arr++;  
   for(i=1;i<n;i++,arr++)  
   {  
    if(*arr>lar)  
    {  
      sec_lar = lar;  
      lar = *arr;  
    }   
    else if(*arr>sec_lar)  
    {  
      sec_lar = *arr;  
    }  
    else if(lar==sec_lar )  
    {  
      sec_lar =*arr;  
     }  
   }  
   return sec_lar;  
 }

Note : We have used the last condition because, initially largest = second laregst = 0th element

Comments

Introduction to AVL tree

AVL tree is a balanced binary search tree where the difference between heights of two sub trees is maximum 1. Why balanced tree A binary tree is good data structure because search operation here is of the order of O(logn). But this is true if the tree is balanced - which means the left and right subtrees are almost equal in height. If not balanced, search operation will take longer. In worst case, if the tree has only one branch, then search is of the order O(n). Look at this example. Here all nodes have only right children. To search a value in this tree, we need upto 7 iterations, which is O(n). So this tree is very very inefficient. One way of making the tree efficient is to, balance the tree and make sure that height of two branches of each node are almost equal. Height of a node Height of a node is the distance between the node and its extreme child. In the above a diagram, height of 37 is 3 and height of left child of 37 is 0 and right child of 37 is 2. Bal...

Reverse a singly linked list

One of the commonly used interview question is - how do you reverse a linked list? If you talk about a recursive function to print the list in reverse order, you are so wrong. The question is to reverse the nodes of list. Not print the nodes in reverse order. So how do you go about reversing the nodes. You need to take each node and link it to previous node. But a singly linked list does not have previous pointer. So if n1 is current node, n2 = n1->next, you should set n2->next = NULL But doing this would cut off the list at n2. So the solution is recursion. That is to reverse n nodes n1,n2,n3... of a list, reverse the sub list from n2,n3,n4.... link n2->next to n1 set n1->next to NULL The last step is necessary because, once we reverse the list, first node must become last node and should be pointing to NULL. But now the difficulty is regarding the head? Where is head and how do we set it? Once we reach end of list viz n1->next ==NULL, th...

Balanced brackets

Have you observed something? When ever you are writing code using any IDE, if you write mismatched brackets, immediately an error is shown by IDE. So how does IDE know if an expression is having balanced brackets? For that, the expression must have equal number of opening and closing brackets of matching types and also they must be in correct order. Let us look at some examples (a+b)*c+d*{e+(f*g)} - balanced (p+q*[r+u )] - unbalanced (p+q+r+s) ) - unbalanced (m+n*[p+q]+{g+h}) - balanced So we do we write a program to check if an expression is having balanced brackets? We do need to make use of stack to store the brackets. The algorithm is as follows Scan a character - ch from the expression If the character is opening bracket, push it to stack If the character is closing bracket pop a character from stack If popped opening bracket and ch are not of same type ( ( and ) or [ and ] ) stop the function and return false Repeat steps 2 and 3 till all characters are scanned. On...

Data structures

Search This Blog