# C++ Programming Code Examples

## C++ > Sorting Searching Code Examples

This C++ program sample sort the given data using Selection Sort. Selection sort algorithm sort data by comparing one element to every other element & decide its position. The time

Shell sort is improvement over insertion sort. It 'compares' the element separated by a gap of several positions. A data element is sorted with 'multiple' passes and with each pass gap

We can implement the task best using 'Radix' sort. In this algorithm Sorting of data is done from least significant digit to most significant digit. Need 10 different spaces labeled '0 to 9'

It initializes the value current level, permutes the remaining values to the 'higher levels'. As the Assigning Action of the values reaches to the "Highest Level", it prints the permutation

Algorithm takes the input of "n" data element and 'prints all possible combination'. Function to 'Print array element' according to the code in the 'Argument List'. For that, it generates n

Searching based on Locality of Reference and also called Principle of locality. So Depending on the memory access pattern data elements are "reallocated". In general search, 80% time

"Self-Organizing" List updates on the basis of 'last searched item'. The sequential searching approach is used. In general search, 80% time only specific 20% of data is accessed. Sample

Stooge sort is a recursive sorting algorithm. It Divides the Array into 2 overlapping parts, 2/3 each. Sort the first part. Sort second part and again sort the first part. Then Print the Result

In each iteration, Sorting is done in two Parts. At first, "set the highest" value to the highest index and decrement the index. Then Lowest Value to the Lowest Index and increment the

Implement to binary search on a sorted array. For the mid index value of any of a 'Subarray', instead of calculating refer Lookup Table. It is an improvement in 'Binary Search' since table

This algorithm takes the input of a string with all distinct characters 'N' Value. It places each character to every index by Swapping Values. A function to 'swap character' values of string

Construct Binary Search tree for the unsorted data array. 'Search the element' starting from the Root of the Tree. Proceed with the search by comparing an element to the data of node

Using Fibonacci numbers we calculate mid of data array to search the data item. 'Calculate' the mid of the array. Divide the array into two subarray. 'Compare the item' by mid element

This program sorts the 10 strings (entered by the user) in Lexicographical order (dictionary order). This program takes 10 words from the user and sort them in 'Lexicographical Order'

To perform "Binary Search" in 'C++', enter the array size, enter the array elements. Now ask to enter an element that is going to be search to "start searching" that element using binary

To sort an array in ascending order by bubble sort in C++ language, you have to ask to user to enter the array size then ask to enter array elements, start sorting the array elements by

To sort an array using insertion sort, enter the array size and then array elements in random order. Start Sorting the Elements of the array in Ascending Order using insertion sort as like

First ask to enter the array size then it will ask to enter the array elements, then it will finally ask to enter a number to be search in array to check whether it is present in the array or not

Here, we use 'swapping' of the elements with the help of a Variable say temp of same type. That is, on found, start 'Swapping' with temp variable, place the first number in the temp &

Program should display all 'random elements' of array and minimum and maximum number in array on screen. Array size is fixed to 100 to change the size just change the 'Value of size'

In case of 'an array' we check that a given key or a number is present in array at any index or not by "comparing each element" of array. By traversing the whole data structure elements

A program which takes some 'Elements' in an array and a 'Key' in variable then program use 'Binary Search' C++ Algorithm to find the key. One to sort array using 'Bubble Sort'. Second

The Bubble Sort is a simple sorting algorithm that 'repeatedly' steps through the List to be sorted, compares each pair of adjacent items and swaps them if they're in the wrong order.

The 'Heapsort' is a comparison-based sorting algorithm. 'Heapsort' can be thought of as an improved 'Selection Sort': like that algorithm, it divides its input into a sorted & an unsorted

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

Linear search is method for searching a value within an array. It 'sequentially' checks one by one of the arrays for the 'target element' until 'match is found' or until all the elements have

"Quicksort" is an Efficient Sorting Algorithm, serving as systematic method for placing the elements of an array in order. 'Quicksort' can operate 'in-place' on an array, requiring small

"Shellsort", also known as Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a 'Generalization of Sorting' by exchange or 'sorting by insertion'. Method

Page 1 Page 2