C++ while statement Sorting an array in ascending sequence

Description

C++ while statement Sorting an array in ascending sequence

#include <iostream>
#include <iomanip>
int main()/* w  w w  .ja  v a  2s  .c o  m*/
{
  const int size {1000};            // Array size
  double x[size] {};                   // Stores data to be sorted
  double temp {};                      // Temporary store for a value
  int count {};                     // Number of values in array

  while (true)
  {
    std::cout << "Enter a non-zero value, or 0 to end: ";
    std::cin >> temp;
    if (!temp)
      break;

    x[count++] = temp;
    if (count == size)
    {
      std::cout << "Sorry, I can only store " << size << " values.\n";
      break;
    }
  }
  std::cout << "Starting sort." << std::endl;
  bool swapped{ false };           // true when values are not in order
  while (true)
  {
    for (int i {} ; i < count - 1 ; ++i)
    {
      if (x[i] > x[i + 1])
      { // Out of order so swap them
        temp = x[i];
        x[i] = x[i+1];
        x[i + 1] = temp;
        swapped = true;
      }
    }
    if (!swapped)                      // If there were no swaps
      break;                           // ...they are in order...
    swapped = false;                   // ...otherwise, go round again.
  }

  std::cout << "Your data in ascending sequence:\n"
            << std::fixed << std::setprecision(1);
  const int perline {10};           // Number output per line
  int n {};                         // Number on current line
  for (int i {} ; i < count ; ++i)
  {
    std::cout << std::setw(8) << x[i];
    if (++n == perline)                // When perline have been written...
    {
      std::cout << std::endl;          // Start a new line and...
      n = 0;                           // ...reset count on this line
    }
  }
  std::cout << std::endl;
}



PreviousNext

Related