Question

I’m trying to sort a 10X15 array of characters, where each row is a word. My goal is to sort it in a descending order, from the largest value word at the top, at array[row 0][column 0 through 14] position, and the smallest value word at the bottom array[row 9][column 0 through 14]. Each row is a word (yeah, they don’t look as words, but it’s to test the sorting capability of the program).

To clarify: What I need to do is this… considering that EACH row is a whole word, I need to sort the rows from the highest value word being at the top, and the lowest value word being at the bottom.

Edit:

Everything works now. For anyone who has a similar question, look to the comments below, there are several fantastic solutions, I just went with the one where I create my own sort function to learn more about sorting. And thanks to all of you for helping me! 🙂

Answer 1

You are using c++ so quit using arrays and begin with stl types:

Convert each row into a string:

string tempString
for (int i = 0; i < rowSize; ++i) {
    tempString.pushBack(array[foreachrow][i])
}

add them to a vector

std::vector<std::string> sorter;
sorter.push_back(tempString);

Do that for each row.

std::vector<std::string> sorter;
for each row {
    for each coloumn {
        the string thing

    }
    push back the string
}

Then sort the vector with std::sort and write the vector back into the array (if you have to but don’t because arrays suck)