This article from code fellows speaks about the price of pain. Mental, physical and emotial pain will be experienced in this class.
I’ll have to forge my own solutions and do my own research to figure things out. Collaborating with my co-classmates, and exit my comfort zone to succeed. But with the pain will come growth.
Create a story based off my experience with these aspects:
You’re here because you chose to invest in a different life. A better life.
Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O Specifically describes the worst-case scenario.
Different kinds:
Binary search is a technique used to search sorted data sets. It works by selecting the middle element of the data set, essentially the median, and compares it against a target value. If the values match it will return success. If the target value is higher than the value of the probe element it will take the upper half of the data set and perform the same operation against it. Likewise, if the target value is lower than the value of the probe element it will perform the operation against the lower half. It will continue to halve the data set with each iteration until the value has been found or until it can no longer split the data set.