Humans somehow construct opinions that may conflict with each other. How do you determine that something is true? Seriously, how do you determine that a statement is irrefutably true? If you can say that a particular statement is irrefutably true then those people who disagree can be fairly called illogical. More importantly, we can confidently build knowledge upon it.
For the love of all decidable things, watch this video!
In this article, I would like tell you about my personal opinion regarding why the world is so messed up. I do not intend to offend, insult, or attack any person or group of people in particular, and everything I mention or say here is just for the sake of making a point. Of course, since this is a blog about computer science and mathematics, I will be using an example from elementary mathematics to explain why the world is so messed up. Let’s start with watching this video: Continue reading
In the previous part we determined the average-case running time of linear search when x, the element we are looking for, appears at least one time in a given array A. In this part, I will show a simpler way to determine the average-case running time. Continue reading
Welcome to the second part of the series in which I will provide an analysis of the average-case running time of linear search. This turns out to be so much more fun than what I have expected. Recall that we are considering three cases depending on how many times the element x appears in A. Continue reading