Well we could get a 1.

I'll do this right over here where I have the columns labeled with the numbers I could roll on the second die 1, 2, 3, 4, 5, or a 6.

And actually that meets our constraints, but we won't go there just yet.

And then when you get a 3 on the second die, you might have gotten a 1, 2, 3, 4, 5, or 6 on the first die.

If we get a 1 on the first die, we have to get a 1 on the second die.

It actually has 3 vanishing points

So I can get all heads.

I pick the i'th data item, and I count how often does this occur in the entire list.

She had one crash with a parachute

And what do I mean by that?

So how do we do it?

All right.

That is plus 6, right?

1s

1st

It's a wonderful room.

One

Right?

I'll just list 4 or 5 of them.

If you're thinking this looks an awful lot like HTML, you are correct.

What are the outcomes there?

Sure. So I would start getting good at two main technologies.

This example illustrates two things that are central to this course.

The number 3 you have to halve it once to get down to 1 and then once more.

So how do we get 37? Well 37 is row one column one of the product.

However, they're not exactly the same.

I can access its elements the same way I would for a list.

For one of these things to be in the return value, two things have to be true.

So this is 0th index.

So now, when we're in row 2, column 1, we cross out row 2, cross out column 1.

So when will it be switched?

1, 2, 3, 4.

But the types of intellectual property, shorthand IP, you want to think about are these.

Suppose that you wanted to square all of the numbers in the list 1, 2, 3, 4, 5.

So let's look at a more complicated case.

To do that, we're going to learn two really big ideas in computer science.

Our organization works on three levels.

Now, I have three options that I would like to show you.

I knew the minute you came in.

So, this was the matrix A and so A 1 3 comma colon means get everything from the first row and from the second row and from the third row and the colon means, you know, one both of first and the second columns and so this gives me this 1 2 5 6.

Let's look at the order in which nodes were marked.

If it's 1, you have to halve it once.

It looks like it's a linear function so far, but actually it diverges now.

The first shot takes him out of order, and the second finishes him off.

If we never find any occurrence of t in s , the goal is to return 1 .