Let's see how that works in the Python interpreter.

Okay, let's do insertion first. It does an insertion in this list. That insertion takes Θ(k).

Okay, we need to make a list.

We're going use this function is_list, and if p is a list, then what we are going to do is create a new list, an empty list.

So I don't want my_sort() to return a copy of the list. I want, after I call my_sort() on a , if I then refer to a

If they equal the course we're looking for, we're going to append it to a list of our results.

We have a for statement where we'll introduce the name e as the variable name.

And there's tradeoffs to doing it this way.

So let's write a factors list over here.

I want lists in three days. Go.

We'll make a list.

Now, selection is the same.

You're going to multiply pi with pMiss.

I'll send you our register.

If we have the list 0, 1 the list 2, 3 the result is the list 0, 1, 2, 3.

And you may have seen sets in mathematics, but if you haven't a list can have elements repeated.

Now to get all the subsets, which is something called a power set, if you're familiar with set theory, we run it through this other function called all subsets that takes a

Let's redefine the 0th element of a.. to be another list.

The top k algorithm that we have so far.

I have to check them all.

If we wanted a more exact answer, we need to use floating point division.

Each item in the list begins with an LI tag standing for list item.

The list, yeah, yeah, yeah. You see, it was like this.

Reverse List

Export SMS List to CSV

Hey, they're posting the list.

I'll add it to my list that I made of potential hangout spots.

The first statement creates a new list.

This isn't always the case, but this is how I'm going to explain this problem.

That creates... That looks like...

It doesn't seem particularly useful because there's no structure to the things we've put in the list.

Then we're going to reverse the process here.

So we could write 120 is equal to is to 1 times 120.

Let's say that I have... Let me define some new...

For the final quiz for this unit, your goal is to change the look up procedure to now work with dictionaries.

No problem. I took care of everything. Everything on the list.

Now, recall that the output of a lexical analyzer is a list of tokens.

Now we're reassigning what p points to to the original value of p, which is this, concatenated with the list 1.

Sort List

Reset List

Burnett will be on Dubaku's list.

So here are a few examples.

So let's run this sample code and see what happens.

That by using mutation, by having lists that could contain other lists or any other kind of data we want, we can build very complex data structures, and we can do lots of interesting things.

For God's sake don't worry me.