Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 12
Lecture 6: Order Statistics, Median
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"Today we're going to not talk about sorting. This is an exciting new development. We're going to talk about another problem, a related problem, but a different problem. We're going to talk about another problem that we would like to solve in linear time. Last class we talked about we could do sor ...
Leto: 2005 Vir: videolectures.net
Lecture 1: Administrivia, Introduction, Analysis of Algorithms, Insertion Sort, Mergesort
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"We're going to get started. Handouts are the by the door if anybody didn't pick one up. My name is Charles Leiserson. I will be lecturing this course this term, Introduction to Algorithms, with Erik Demaine. In addition, this is an SMA course, a Singapore MIT Alliance course which will be run in ...
Leto: 2005 Vir: videolectures.net
Lecture 4: Quicksort, Randomized Algorithms
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"OK. Today we are going to talk about a very interesting algorithm called Quicksort -- -- which was invented by Tony Hoare in 1962. And it has ended up being a really interesting algorithm from many points of view. And because of that, it turns out today's lecture is going to be both hard and fast ...
Leto: 2005 Vir: videolectures.net
Lecture 7: Hashing, Hash Functions
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"Today starts a two-lecture sequence on the topic of hashing, which is a really great technique that shows up in a lot of places. So we're going to introduce it through a problem that comes up often in compilers called the symbol table problem. And the idea is that we have a table S holding n reco ...
Leto: 2005 Vir: videolectures.net
Lecture 8: Universal Hashing, Perfect Hashing
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"Hashing. Today we're going to do some amazing stuff with hashing. And, really, this is such neat stuff, it's amazing. We're going to start by addressing a fundamental weakness of hashing. And that is that for any choice of hash function There exists a bad set of keys that all hash to the same slo ...
Leto: 2005 Vir: videolectures.net
Lecture 11: Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"Good morning. Today we're going to talk about augmenting data structures. And this is a -- Normally, rather than designing data structures from scratch, you tend to take existing data structures and build your functionality into them. And that is a process we call data-structure augmentation. And ...
Leto: 2005 Vir: videolectures.net
Lecture 13: Amortized Algorithms, Table Doubling, Potential Method
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"OK, good morning. So today we are going to, as I mentioned last week, we've started the part of the course where we are doing more things having to do with design than purely analysis. Today, we're actually going to do analysis, but it's the type of analysis that leads to really interesting desig ...
Leto: 2005 Vir: videolectures.net
Lecture 14: Competitive Analysis: Self-organizing
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"And this is going to use some of the techniques we learned last time with respect to amortized analysis. And, what's neat about what we're going to talk about today is it's a way of comparing algorithms that are so-called online algorithms. And we're going to introduce this notion with a problem ...
Leto: 2005 Vir: videolectures.net
Lecture 15: Dynamic Programming, Longest Common Subsequence
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"So, the topic today is dynamic programming. The term programming in the name of this term doesn't refer to computer programming. OK, programming is an old word that means any tabular method for accomplishing something. So, you'll hear about linear programming and dynamic programming. Either of th ...
Leto: 2005 Vir: videolectures.net
Lecture 16: Greedy Algorithms, Minimum Spanning Trees
Charles E. Leiserson , Massachusetts Institute of Technology, MIT
Video in druga učna gradiva
Oznake:
//"OK, today we're going to start talking about a particular class of algorithms called greedy algorithms. But we're going to do it in the context of graphs. So, I want to review a little bit about graphs, which mostly you can find in the textbook in appendix B. And so, if you haven't reviewed in ap ...
Leto: 2005 Vir: videolectures.net
Št. zadetkov: 12
Leto izdaje:
Repozitorij:
Tipologija:
Jezik: