Example:

Given array {10, 18, 25, 30, 5, 11}

Smallest element: 5

Second smallest element: 10 

Algorithm:

1. Sort the array in ascending order using sort().
2. First and second element are the smallest and second smallest number.

Code:

#include <bits/stdc++.h>
using namespace std;

int main()

{

	int array[100], i, n;

	cout << "Enter number of elements in the array: ";

	cin >> n;

	cout << "\nEnter array: ";

	for (i = 0; i < n; i++)

		cin >> array[i];

	//sorting the array 

	sort(array, array + n);

	//first two elements are the result

	cout << "Smallest number is:  " << array[0] << "\nSecond smallest number is " << array[1] << endl;

	return 0;

}

Time Complexity: O(NlogN)
Space Complexity: O(N)

Report Error/ Suggestion

Related Posts:

• Program to find k largest elements in a given array of integers in C++
• Program to calculate the series (1) + (1+2) + (1+2+3) + … + (1+2+3+4+…+n) in C++
• Subtraction of matrices in C++
• Program to print Floyd’s triangle star pattern in C++
• Factorial Program in C++