​Games Technologist

Programming, Algortihms & Data Structures

The goal for this project was separated into two distinct parts:

1. Understanding and implementing:

• Big O Notation

• Harmonic series

• Recursive Functions

• Linear Search

• Duplicate Search

• Range Search

• Sort functions

• Node Deletion

• Time Complexity Table

2. Understanding and implementing:

• Pseudo-code

• Graph building

• Graph Traversal Breadth First Search (BFS)

• Graph dot output

• Webviz Graphics (illustrating node connections)

• Binary tree setup

• Binary Tree Find function

• Binary Tree deletion function

• Signal processor sign wave!

​

This year two module was intensive, and was great fun as well; But I have to say, it took a lot of lessons, hard work and conversations to get this done! If anyone looks and this work and this wow, I accept them praise; however, I could not have done this without talking to people, and researching the internet, and embracing the struggle and not giving up; and I take the time to thank David Croft, because he can talk and draw up computer science  terms in laymen terms, which is something I feel teaching really needs! And having people around me all working and struggling with different elements of their projects made hilarious conversations come into being!

​

I hope anyone reading this post understands, that just talking to people around you, and having colloquial conversations, can really be a massive aid, alongside not being afraid to be the class idiot who asks stupid questions so you understand what to do. 

​

​

​