Solving problems on recurrence relations and asymptotic notations
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 demonstrat...
Saved in:
Main Author: | Ng, Dasmond |
---|---|
Other Authors: | S Supraja |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/176966 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A tractarian approach to non-linguistic representation: Musical notation as picturing
by: Diamante, Sidney Carls
Published: (2010) -
Convergence to equilibria in recurrence equations
by: Agarwal, R.P., et al.
Published: (2014) -
THE ROLE OF NUMERICAL NOTATION AND TIME INTERVALS IN NUMERICAL PROCESSING
by: ONG SHI HUI
Published: (2020) -
Program transformation by solving recurrences
by: Luca, B., et al.
Published: (2013) -
A semiotic analysis of unified modeling language graphical notations
by: SIAU, Keng, et al.
Published: (2009)