Author | Aidan Beil |
Date | 14/2/2024 |
Class | CS240 2963 |
Professor | Darrell Criss |
[2] Wikipedia
[3] Wikipedia
[4] The Algorithm Design Manual
[5] https://csguide.tech/s/articles/horners_method_of_hash_calculation
[6] https://www.cs.umd.edu/class/fall2019/cmsc420-0201/Lects/lect10-hash-basics.pdf
[7] Learning Rust With Entirely Too Many Linked Lists
[8] Recursive Tower of Hanoi using 4 pegs / rods
[9] Tower of Hanoi
[10] https://upload.wikimedia.org/wikipedia/commons/2/20/Tower_of_Hanoi_recursion_SMIL.svg
[11] Khan Academy
[12] Linear interpolation
[13] The Beauty of Bézier Curves
[14] https://doc.rust-lang.org/rust-by-example
[15] Pan + Orbit Camera
[16] Unofficial Bevy Cheat Book
[17] Migration guides
[18] Bevy Quick Start
[19] Animated transform example
[20] UI (User Interface) / Button
[22] Event
[23] Cursive docs
[24] TheWindowsClub
[25] StackExchange
[26] LibreOffice
[27] Wikimedia
[28] WCC library
[29] GeeksForGeeks
[30] https://www.baeldung.com/cs/levenshtein-distance-computation
[31] Wikipedia