Selection Sort (in C++)

• The following code sorts an array of integers using a selection sort.
  
  
• Here is the code for the main program (Note: how can you tell this is C++ and not C?):

  #include <iostream>
  
  int main()
  {
      const int   nitems = 5;
  
      int numbers[nitems];
      int top;
      int largest;
      int tmp;
      int i;
      int j;
  
      numbers[0] = 25;
      numbers[1] = 1;
      numbers[2] = 11;
      numbers[3] = 18;
      numbers[4] = -3;
  
      cout << "\nHere is the unsorted array:\n");
      for (i = 0; i < nitems; i++)
          cout << "i is : " << i << "number is: "
              << numbers[i] << endl;
  
      // Sort the array with a selection sort
  
      top = 0;
      for (top =0; top < (nitems -1); top++)
      {
          largest = top;
          for (i = (top + 1); i < nitems; i++)
          {
              if (numbers[i] > numbers[largest])
                  largest = i;
          }
  
          // switch the 2 elements
  
          tmp = numbers[largest];
          numbers[largest] = numbers[top];
          numbers[top] = tmp;
      }
  
      cout << "\nHere is the sorted array:\n");
      for (i = 0; i < nitems; i++)
          cout << "i is : " << i << "number is: "
              << numbers[i] << endl;
  
      return(0);
  }
  
  

• The output would be:

     Here is the unsorted array:
  
      i is: 0 number is: 25
      i is: 1 number is: 1
      i is: 2 number is: 11
      i is: 3 number is: 18
      i is: 4 number is: -3
  
      Here is the sorted array:
  
      i is: 0 number is: 25
      i is: 1 number is: 18
      i is: 2 number is: 11
      i is: 3 number is: 1
      i is: 4 number is: -3