An algorithm starts with a single equilateral triangle and on each subsequent iteration adds new triangles all around the outside. The results for the first three values on n are shown in the image above. How many small triangles will be there after the nth iteration?
A sorting algorithm puts a list of elements in a particular order. In python, if you want to sort a list, you can do list.sort(), however, here we will explore how to create our own sorting function.
You and a stranger are imprisoned and put into separate rooms with no way to communicate with each other. Police officers bargain with you and the stranger separately and simultaneously... You are given the choice to confess or deny the crime. What would you do..?