Informatics Q1

 

The entry into the recursion starts with calculation algorithms such as n!, Fibonacci sequence, gcd and lcm and continues with recursive graphics. A prime example of recursion is the algorithm of the problem "Towers of Hanoi". However, the applet presented here has been using the knowledge of the data structure "stack" forward. At various examples such as term calculators, waiting rooms and car washs linear data structures List, Stack and Queue are demonstrated. It continues with examples of searching and sorting. Finally, tree structures are presented with various examples.