Here are some monkeys based on some sorting algorithms. Algorithms are sets of rules that can be ordered to a computer to do a task, and sorting ones aim to sort a list in order. One of the less effective sorting algorithms is called the Bogosort which selects random permutations until the list happens to be sorted, similar to the Infinite Monkey Theorem where infinitely banging a keyboard randomly might write out anything eventually. One of the more effective sorting algorithms is called the Quicksort which uses a binary search tree, a structure that splits things into two paths. Groups are split into two around a random member of the list (now called a pivot) and then determined whether another member comes before or after it. In these two new groups, the same logic is applied as a new pivot member in that subgroup is selected. This repeats until everyone has been sorted.
Monbogo (Normal): Monbogos do not like to stay still as they use their paws to randomly hit or reorder anything they see. Monbogos like to press Compupa's buttons relentlessly, and rarely, they can make the Compupa speak like a human.
Atelgo (Normal/Bug): Atelgos are known for their organization as they make their livings spaces clean and organized. They often have very little patience towards cluttered messes as they use all of their limbs to efficiently tidy them.
