This is a program to solve variants of problem #2 in the book Algorithms.The problem goes as follows: 2.Sock selection There are 20 socks in a drawer: 5 pairs of black socks, 3 pairs of brown, and 2 pairs of gray.You select the socks in the dark and can check them only after a selection has been made.What is the smallest number of socks you need to select to guarantee getting the following (a)At least one matching pair (b)At least one matching pair of each color The problem is actually about gloves but I personally could relate more to socks so yeah.The infinity sign is going to be my intro because it looks cool and is math related.
