Solving problems on recurrence relations and asymptotic notations

• المؤلف الرئيسي: Ng, Dasmond
• مؤلفون آخرون: S Supraja
• التنسيق: Final Year Project
• اللغة: English
• منشور في: Nanyang Technological University 2024
• الموضوعات: Computer and Information Science; Recurrence relation; Asymptotic notation; Recursive
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/176966
• المؤسسة: Nanyang Technological University

This final-year project is about solving problems on recurrence relations and asymptotic notations. This report researched the practical application of recurrence relations. All applications will be created using Python and its module libraries. The purpose of these applications is to demonstrate visually the solutions found. In summary, this project will act as a guide for readers to learn about recurrence relations and asymptotic notations. Readers can learn through the multiple applications created with Python. This report provides explanations for both the theory and the practical applications. Overall, the aim is to research and educate readers on the concept of recurrence relations and asymptotic notations.