Ministry of higher and secondary public education of the republic of uzbekistan academic lyceum at the uzbek state university of world languages

What Is Sorting in C++?

Sorting in C++ is a concept in which the elements of an array are rearranged in a logical order. This order can be from lowest to highest or highest to lowest. Sorting an unsorted array helps to solve many problems such as searching for the minimum or maximum element, etc.
Arranging things in a sorted manner makes it easier to analyze and search for a particular element among the collection of elements.
For example, In the below example, we are sorting or arranging the elements of an unsorted array in ascending order, i.e., from lowest to highest.

Categories of Sorting in C++

The categories of sorting are:

• 
  Internal sorting
  
• 
  External sorting
  

We know that all the programs are stored inside the hard disk, and whenever we run a program in C++, it comes to the RAM.


In internal sorting, the data to be sorted is present in the main memory or RAM, and sorting process will also occur in the main memory itself. Examples of internal sorting are bubble sort, insertion sort, selection sort.
While in the case of external sorting, the data is not always present in the RAM because the data is large. So data is filled in the RAM or main memory in small portions. An example of external sorting is the Merge sort.


Types of Sorting Techniques
There are various types of sorting techniques in C++. We will be learning the most popular ones in this article.

• 
  Bubble sort
  
• 
  Selection sort
  
• 
  Insertion sort
  
• 
  Quick sort
  

Bubble Sort 

Bubble sort is one of the most straightforward sorting algorithms. In this sorting technique, we begin by comparing the first two elements of the array and checking if the first element is greater than the second element; if it is, we will swap those elements and move forward to the next element. 

If the first element is not greater than the second, then we don’t need to swap it. And this process will keep on repeating till the end of the array.