Four plants are scored on six characters, coded (present) or (absent). You will count the characters alike for a pair, turn it into a per cent, and find the most alike pair.
The idea. Numerical taxonomy gives every character the same weight. Similarity = characters alike ÷ characters scored × 100.
Your tasks.
alike, return the number of positions where the two codes are the same.similarity, return the per cent, using alike.best_pair to the pair of names with the highest similarity.Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Log in to join the discussion.
Loading…