- //sort each row by group and when you do, swap rows too.
- for (int i = 0; i < numSeqs; i++) {
- quicksort(0, numSeqs-1, i);
- }
- }
- catch(exception& e) {
- cout << "Standard Error: " << e.what() << " has occurred in the FullMatrix class Function sortGroups. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
- exit(1);
- }
- catch(...) {
- cout << "An unknown error has occurred in the FullMatrix class function sortGroups. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
- exit(1);
- }
-
-}
-/**************************************************************************/
-//this is a version of quicksort taken from http://www.c.happycodings.com/Sorting_Searching/code13.html
-/* sort everything inbetween `low' <-> `high' */
-void FullMatrix::quicksort(int low, int high, int row) {
- try {