C++程序练习-1007:DNA Sorting-冒泡排序

描述
One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be---exactly the reverse of sorted).

You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.

输入
The first line contains two integers: a positive integer n (0 < n <= 50) giving the length of the strings; and a positive integer m (0 < m <= 100) giving the number of strings. These are followed by m lines, each containing a string of length n.
输出
Output the list of input strings, arranged from ``most sorted'' to ``least sorted''. Since two strings can be equally sorted, then output them according to the orginal order.
样例输入
10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT
样例输出
CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA

思路：
先要知道DNA的权衡(尺度)，然后根据权衡排序。
算法：
1.建立DNA类模型
2.输入数据
3.根据权衡排序
4.输出排序后的DNA
//冰非寒(binfeihan@126.com) //248kB 0ms 1617 B G++ #include <iostream> #include <string> using namespace std; //class definition:DNA typedef class DNA{ public: string dna; int level; void setlevel(); }DNA; void DNA::setlevel(){ //initialize int len; len = this->dna.length(); this->level = 0; //set level for(int i(0);i < len - 1;++ i){ for(int j(i + 1);j < len;++ j){ if(this->dna[i] > this->dna[j]){ this->level ++; } } } } //global variable DNA d[101]; //sort by level asc void bubblesort(int n){ int flag; DNA temp; for(int i(0);i < n - 1;++ i){ flag = 0; for(int j(0);j < n - i - 1;++ j){ if(d[j].level > d[j + 1].level){ temp = d[j]; d[j] = d[j + 1]; d[j + 1] = temp; flag = 1; } } if(!flag){ break; } } } int main(){ //local variable int n,m; //initialize and inutp data std::cin>>n>>m; for(int i(0);i < m;++ i){ std::cin>>d[i].dna; d[i].setlevel(); } //sort bubblesort(m); //print result for(int i(0);i < m;++ i){ std::cout<<d[i].dna<<std::endl; } return 0; }