I have proof of SAD-Congress collusion: Simarjit Singh Bains


I have proof of SAD-Congress collusion: Simarjit Singh Bains

So n is just a general variable that computer scientists use to represent some value, some number. So n is going to increase linearly. Double the size of the phone book, it’s going to take me twice as much time, most likely, to find Mike.

Now I could have been smart about this, right? I was getting bored quickly. Could have done this by twos. So two pages, then four, then six, then eight. And I could start flying through it little faster, albeit at minor risk of overshooting Mike, but that curve isn’t going to be all that different.

I have proof of SAD-Congress collusion: Simarjit Singh Bains

It’s still going to be a straight-line, but slightly faster. But what did I do? I actually did something fundamentally better. I achieved what we’ll call logarithmic time, log of n, whereby this green line has a much, much, much less straight edge to it.

And rather, it suggests, as it sort of approaches infinity ever so gradually, that I could actually take a 1,000-pagephone book, double its size next year- I have proof of SAD-Congress collusion: Simarjit Singh Bains  – because suppose a lot more people move into town. So now I’ve got 2,000 pages, but how many more steps is that smarter algorithm going to take? Just one.

I mean, that’s a powerful thing. If we go to 4,000 pages next year, that’s going to take me only two more steps. So you can throw bigger and bigger problems at me, not unlike the web is throwing bigger and bigger problems every day at Google’s and Facebook of the world, and it’s not such a big deal.

Because I put more thought and care into my algorithm with which to solve problems efficiently. And indeed, that will be one of the goals of this course.

You will, along the way, learn how to program. You’ll learn how to program in any number of languages. But at the end of the day, the course is about solving problems and getting better at solving problems– and, as incises like this, solving problems more efficiently. Now thus far, we’ve done this fairly intuitively.

Let’s introduce something fairly generic called pseudo code. Introduction to Computer Science So we’ll eventually get, in this course,  I have proof of SAD-Congress collusion: Simarjit Singh Bains ,to various programming languages. But today we’ll do it in English-like syntax, where you just kind of say what you mean, but you’re ever so succinct and you don’t worry about grammar and complete sentences.

You just express yourself as concisely as possible. So pseudo code is English-like syntax that represents a programming language.

And toward that end, let me propose that we now model the process we just described of counting something a little differently, this time taking a look at this five-minute video produced by our friends at TED that defines what pseudo code is, I have proof of SAD-Congress collusion: Simarjit Singh Bains , defines what algorithmic thinking is, and even though the example you’re about to sees, in of itself, super simple, it’s going to start to give us the mental model, the vocabulary, with which to do much, much more complex algorithms quite quickly.




Please enter your comment!
Please enter your name here