Angelika Makarova

Besides the function using Luhn algorithm for validating credit card numbers, this code also contains some helpful functions for optimizing the verification process to handle multiple credit cards at a time:

• the function that checks through an array of card numbers for which numbers are invalid, and return an array of invalid cards;
• the function that returns an array of companies which have issued these invalid numbers;
• the function that accepts a string and converts it into an array of numbers to make it easier to test credit card numbers;
• the function that converts invalid numbers into valid numbers.

Objects created with this factory function have some methods useful for the research:

• the method simulating the high rate of mutation that randomly selects a base in the object’s DNA and changes the current base to a different base;
• the method that compares two objects and computes the percentage of DNA the two objects have in common;
• the method computing if an object has likelier chance of survival (if its DNA is made up of at least 60% 'C' or 'G' bases);
• the method that returns the complementary DNA strand.

Also I declared and tested the function that creates 30 instances of this organism and store them in an array. And in the end I created the algorithm to find the two most related instances.