The algorithm can be compared to the sorting of fish varieties from a fishnet. The fisherman allots a new slot on the sand each time a new variety is encountered, otherwise, the fisherman adds the fish to previously allotted slots. Likewise, the program initializes the first group with the first sequence entered giving the group a group number. Then the program tallies each new query sequence with the previously initialized group(s) and in case of a match the program lists the sequence with the matching group. In case of no match the program initiates a new group with a serially increased group number. The computer has the ability to tally the sequences because each permutation of the amino acids (containing single letter amino acid code) or nucleotides (A,T,G,C) is associated with a unique numerical value in the hexadecimal numbering system. Unlike most sequence analyses ChameleonSort sorts out the sequences without reference to any standard sequence. Therefore the results of a sorting session is relevant only to the lot of sequences sorted in that session. If results from two or more lots need to be merged then it is necessary to sort the sequences again querying one sequence from each group.