Skip to main content

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

Labels:

Comments

Post a Comment

Popular posts from this blog

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more

Function to add a node to binary search tree

Binary search tree (BST) is an ordered tree where each node has smaller values on the left sub tree and larger values on the right subtree. This is similar to binary search algorithm. And another useful fact is if you traverse the node in in-order method, the values of the tree will be in ascending order. Binary Search Tree with root as 50 Now as you can see from the diagram on the left child and their children of root (which in this case is 50), values are 40, 20 and 45. All are less than 50. On the other hand, on the right sub tree 50, the values are 60, 55 and 78 - larger than 50. And this rule follows for each and every node, not just root. Now if we have to  add a node - let us 43, where shall we add it, in such a way that the tree will still remain as BST. The new node must be a leaf node (i.e. the node with no child nodes) Let us traverse from root and find out where this new node fits. 43 is smaller than 50. Hence we must branch to left of 50. Now we get 40. 4...
Post a Comment
Read more

Program to create a Linked List in C

An array is a commonly used data structure in most of the languages. Because it is simple, it needs O(1) time for accessing elements. It is also compact. But an array has a serious drawback - it can not grow or shrink. You need to estimate the array size and define it during compile time. This drawback is not present a linked list. A linked list is a data structure which can grow or shrink dynamically.  A linked list has nodes each of which contain  contain  data and a link to next node . These nodes are dynamically allocated structures. If you need more nodes, you just need to allocate memory for these and link these nodes to the existing list. The nodes of a linked list have to be defined as self-referential structures in C. That is structures with data members and one member which is a pointer to the structure of same type.  This pointer will work as a link to next node. struct node { int data; struct node * next; //pointer to another node }...
1 comment
Read more