sorting algorithms in c++ code example

Example 1: sort algorithms java

for (int i = 0; i < arr.length; i++) {
   for (int j = 0; j < arr.length-1-i; j++) { 
     if(arr[j]>arr[j+1])
     {
       int temp=arr[j];
       arr[j]=arr[j+1];
       arr[j+1]=temp;
     }
   }
   System.out.print("Iteration "+(i+1)+": ");
   printArray(arr);
  }
  return arr;
// BUBBLE SORT

Example 2: sorting algorithm c++

#include<iostream>
using namespace std;

int main(int argc, char const *argv[])
{
    int numb[7];
    int i, j;

    for(i=0;i<=6;i++)
    {
        cout << "Enter a number" << endl;
        cin >> numb[i];
    }

    for (i=0;i<=5;i++)
    {
        for (j=i+1;j<=5;j++)
        {
            int temp;

            if (numb[i] > numb[j])
            {
                temp = numb[i];
                numb[i] = numb[j];
                numb[j] = temp;               
            }
          }
        }
        for (i=0;i<=6;i++)
        {
            cout << endl << numb[i] << endl;
        }
}

Example 3: sorting in data structure

A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure.