Overall Project Plans

For the final night at the museum project, we plan to create an algorithm that sorts anime series by popularity, ratings, number of episodes, genre, and how recently it was released. This will be done by initially parsing the web for a list of anime, then appending it to an array. Then, the array of anime titles will be iterated through, then using a google trends api it will check how many times each anime was searched for in the past year to determine their relevancy/popularity. The value for how many times each anime was searched for will be set as a dictionary value, then, using a sorting function, the dictionary will be ordered from most searches to least searches. Furthermore, for rating popularity, utilizing beautiful soup, a web parser, we can parse an anime site to search for ratings, then utilizing a dictionary we can sort by highest rating. This process can be repeated for genre, and the date of release to filter the results out. Or, there can be an array full of arrays to store the values for each anime.

Example:

anime_data = [ [‘Title’, ‘Release Date’, ‘Genre’, ‘Rating’], [‘Attack on Titan’, ‘2013-04-07’, ‘Action, Fantasy’, 8.9], [‘Death Note’, ‘2006-10-04’, ‘Mystery, Thriller’, 9.0], [‘My Hero Academia’, ‘2016-04-03’, ‘Action, Comedy’, 8.4], [‘Demon Slayer’, ‘2019-04-06’, ‘Action, Fantasy’, 8.7], [‘One Punch Man’, ‘2015-10-05’, ‘Action, Comedy’, 8.8] ] This is what the database rows and columns would probably look like.

Requirements

Loops (Algorithmic) Show specific example of building a List using List Comprehension. Show examples of processing a list using conventional and for each methods.

Sorting / Searching (Algorithmic) Show examples of sorting and searching using the backend of your project.. FYI, SQLAlchemy allows filtered selections and sorting. Additionally, you have sorting options discussed in tech talk.

Big(O) Illustrate Space and Time complexity used in your Sorting / Searching algorithm.

  • This project would most likely utilize multiple for loops, but none of them would be nested. The algorithm would have a linear time complexity.
    2D Iteration Show examples of code that use 2D iteration. This can be anywhere in your code where you are using rows and columns.
anime_data = [
    ['Title', 'Release Date', 'Genre', 'Rating'],
    ['Attack on Titan', '2013-04-07', 'Action, Fantasy', 8.9],
    ['Death Note', '2006-10-04', 'Mystery, Thriller', 9.0],
    ['My Hero Academia', '2016-04-03', 'Action, Comedy', 8.4],
    ['Demon Slayer', '2019-04-06', 'Action, Fantasy', 8.7],
    ['One Punch Man', '2015-10-05', 'Action, Comedy', 8.8]
]

Deployment (Full Stack) A complete deployment illustration multiple people using and updating your Full Stack Web Application simultaneously.

  • The user will also be able to have their own ratings on each show and can sort it by those ratings. If the user wants to update their ratings, a PUT request will be sent to the SQL backend and their ratings will be updated.