Happy Codings - Programming Code Examples

Html Css Web Design Sample Codes

CPlusPlus Programming Sample Codes

JavaScript Programming Sample Codes

C Programming Sample Codes

CSharp Programming Sample Codes

Java Programming Sample Codes

Php Programming Sample Codes

Visual Basic Programming Sample Codes

C++ Programming Code Examples

C++ > Sorting Searching Code Examples

C++ Program to Implement Selection Sort

C++ Program to Implement Selection Sort

This is a C++ program to sort the given data using Selection Sort.

- Selection sort algorithm sort data by comparing one element to every other element and decide its position.
- The time complexity of this algorithm is O(n^2).

- Starting from the beginning pick one number.
- Compare it with others one by one.
- replace if the other number is lesser than this one.
- Display the result.
- Exit.

#include <iostream>
 
using namespace std;
 
// Sort arr[] of size n using Selection Sort. 
void SelectionSort (int arr[], int n)
{
	int i, j;
	for (i = 0; i < n; ++i)
	{
		for (j = i+1; j < n; ++j)
		{
			// Comparing consecutive data and switching values if value at i > j.
			if (arr[i] > arr[j])
			{
				arr[i] = arr[i]+arr[j];
				arr[j] = arr[i]-arr[j];
				arr[i] = arr[i]-arr[j];
			}	
		}
		// Value at i will be minimum of all the values above this index.
	}	
}	
 
int main()
{
	int n, i;
	cout<<"\nEnter the number of data element to be sorted: ";
	cin>>n;
 
	int arr[n];
	for(i = 0; i < n; i++)
	{
		cout<<"Enter element "<<i+1<<": ";
		cin>>arr[i];
	}
 
	SelectionSort(arr, n);
 
	// Display the sorted data.
	cout<<"\nSorted Data ";
	for (i = 0; i < n; i++)
		cout<<"->"<<arr[i];
 
	return 0;
}

Insertion Sort Algorithm in C++ Language - Insertion sort is simple sorting algorithm that builds the final sorted array ('or list') one item at a time. It is much less efficient on large lists than more advanced algorithms such as quick

C++ Class Program to Find Prime Number - A 'prime number' is a natural number greater than 1 that has no positive divisors other than 1 and itself. The C++ Programming Language allows you to separate program-specific data

C Program Code Counts Number of Digits - C Program to count number of digits without using loop. The second logic uses logarithms to count number of digits in a given integer. Total number of digit in an integer is equal to

Binary Search Tree non-recursive traversal - In this, includes the inserting a node, deleting a node, recursive tree traversal, non-recursive Tree Traversal, finding the minimum and the maximum, leftchild, rightchild, copy a tree to

Implement Hash Tables by Linear Probing - Insert Element at a key. Search Element at a key. Remove Element at a key. Enter element to be inserted. Enter key at which element to be inserted. And Enter key of the element to

Relational Operators in C++ programming - In C++, This category of the operators is used to compare different values. The result of the operation is a Boolean value. The "Relational" operators are used in the form Operand1 and

Find Fibonacci Series Understanding Logic - The Fibonacci series is infinite but we can not make a C++ program that display an "infinite" output. In program, we take input the "range" in integer upto which Fibonacci series will be

C Code Find Reverse of String by Pointers - Input a 'string from user', store it in a variable say str. 'Declare another Array' that will store 'reverse of the string', say char reverse[SIZE]. Find Length of the string and store it in some