Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Prodentim Probiotics Specially Designed For The Health Of Your Teeth And Gums

Instant Grammar Checker - Correct all grammar errors and enhance your writing

Teach Your Child To Read

Powerful WordPress hosting for WordPress professionals

Disclosure: My content contains affiliate links.

31,166 questions

40,722 answers

573 users

How to find the second smallest elements in an array in C++

1 Answer

0 votes
#include <bits/stdc++.h> 
 
int getTheSecondSmallest(int arr[], int size) { 
    int first, second; 
 
    first = second = INT_MAX; 
    for (int i = 0; i < size ; i ++) { 
        if (arr[i] < first) { 
            second = first; 
            first = arr[i]; 
        } 
        else if (arr[i] < second && arr[i] != first) 
            second = arr[i]; 
    } 
    if (second == INT_MAX) 
        return -1;
         
    return second; 
} 
 
int main(void) 
{ 
    int arr1[] = {34, 3, 8, 2, 9, 4, 6}; 
    std::cout << getTheSecondSmallest(arr1, sizeof(arr1)/sizeof(arr1[0])) << "\n";
     
    int arr2[] = {1, 1, 2, 1, 1}; 
    std::cout << getTheSecondSmallest(arr2, sizeof(arr2)/sizeof(arr2[0])) << "\n";
     
     
    int arr3[] = {5, 5, 5, 5, 5, 5, 5}; 
    std::cout << getTheSecondSmallest(arr3, sizeof(arr3)/sizeof(arr3[0])) << "\n"; 
     
    return 0; 
} 
 
 
 
/*
run:
 
3
2
-1
 
*/

 





answered May 31, 2020 by avibootz
edited May 31, 2020 by avibootz

Related questions

1 answer 57 views
1 answer 65 views
1 answer 55 views
1 answer 64 views
...