A Day Between (Game Dev Pulp Fiction)

I walked off from my home one day, it was a day between days, nothing particular, same colors, same taste, same odor or better say none. I carelessly walking down the most familiar but unfamiliar street, took the bus to my destination, university. got in, fell dead on a seat at the back. closed my eyes and contemplated of all the possible routes of life, fell deaf to the ticking of the clock for a short while, here i am at my stop, got out and paced to my university.

I got into my class room, casted a quick gaze at the once i call "my fellows. took a chair, waited as usual, waited for the big boss to show up. I walked in, closed the door behind him. he began elaborating concepts and ideas regarding the efficiency of a computational task, which is denoted using big 'O'. The topic of the day was Time space Complexity of a computational system. In an ideal situation, were a solution can be found using a mathematical formula the O of the process is said to be O(1). the next scenario is were a system overload is linearly proportional to the number of operation then the system is said to have a O(n). so if the complexity of a system increases but its not as aggressive as linear then it most likely said to have an O(nlogn). Then we moved on to Data structures, which as basically intuitive ways to manage, associate, link and represent finite collection of data or objects. He started by explaining us about Linked list, which is a configuration of objects with a reference to the next one. Then comes the stack and queue, which are similar. Binary tree, which has a pair of children and can be used in systems like spatial partitioning.

He mentioned about hash table, which are heavy on memory side but performs very fast on the CPU. Then comes Graph. which i chose to explain the coming week.