Big O!

I forgot to mention my favorite type of data structure is linked list. The fact that each node is linked to the next one and the next one is linked once again, interests me. It is the simplest representation of recursion to my understanding; solving the same question over again and again or forming the same links repetitively. Each node is indirectly related to another, and being able to trace back to the originator is through one relevancy node. This idea is intriguing to me and would like to further apply this concept in the future. One interesting concept that we learned was that the access time of a dictionary key-value pair is constant

The analysis of sorting methods is in coordination with csc165. We were introduced to Big O notations where algorithms can be bounded by a limit, this characterizes the behaviour of functions. The key behind this concept is the behaviour over a large input and this relates to reality accurately. Business handle large amounts of data, and utilizes the data to operate their business, whether consumer orders or statistical data. The data needs to processed nevertheless, and in a more complicated way than sorting obviously. For example, MapReduce is a programming model for processing large data sets. Optimization is necessary for the most efficient processing as computer programs are made to make life simpler. We are the future computer scientists who will integrate technology with day to day actions. Time does not wait on us, nor do we want to waste time. We need to save time.