Problem: sort DNA sequences by non-sorted-order, where "non-sorted-order" is the number of pairs of element that is not in sorted order. Size: 100 sequences and 50 elements at most.
The solution is straightforward: calculate the non-sorted-order and then sort sequences according to that order. Pointers speeds up program, and library-built sorting functions speed up programming.
No comments:
Post a Comment