sorting arrays (ascending order)

im trying to sort an array with an Array class. here's my code...i picked up some code from a website and stuck it into my sort method...i don't know how else to do it though...note that the sort method has no parameters...that was strictly instructed by my teacher.

Code:

---

class Array
 {
  private:
  const static int declared_size = 100;
  arrElem array[declared_size];
  int numberUsed;

  public:

  void readFromFile(char fileName[])
  {
    ifstream infile(fileName);

    int filesize = 0;
    if (infile.fail())
    {
    cout << "Opening file " << fileName << " failed.  Goodbye." << endl;
    exit(1);
    }

    infile >> ws;
    while (infile >> array[filesize])
    {
      filesize++;
    if (filesize > 100)
      {
      cout << "There are more values in the file than there are positions"       
            << " in the array."
            << endl;
      exit(1);
      }
    }
  numberUsed = filesize;
  infile.close();
 } 

  int getSize(void)
  {
    return numberUsed;
  }
 
  void printArray(void)
  {
    int perLine = 5;
    for (int i = 0; i < numberUsed; i++)
    {
    cout << array[i] << "      ";
    if ((i+1) % perLine==0)
      cout << endl;
    }
  }
 
  void sort(void)
  {
    for (int i = 0; i < numberUsed; i++)
    {
      double x = array[i];
      int j;
    for ( j = 0; j < numberUsed; j++)
    {
      if (array[j] <= x)
          break;
      array[j+1] = array[j];
    }
    array[j+1] = x;
    }
  }
 
};

---

what is ws?

I recommend you do a search of the board using bubble sort as the search words. Bubble sort is probably the easiest sort to implement. There are different versions of bubble sort and there are different sorts other than bubble sort so you can choose.

if(filesize > 100)

means your program will crash, if you're lucky. If declared_size is 100 then the last valid value for filesize is 99, not 100.

I'm in the beginning stages of a similar program, so the coding is a tad flaky. See if you can use the sorting algorithm... a modified quick sort.

http://ronin_akuma.tripod.com/index.html

updated files link

HTH

Bubble sort is real easy (but very inefficient :) )

There are several types of bubble sorts, the one i find easiest in pseudocode:

Code:

---

// sorts from lowest to highest
for (x=0; x<arraySize-1; x++)
{
    for (y=x+1; y<arraySize; y++)
    {
          if (array[x]>array[y])
              swap 'em;
    }
}

---