This class was created by Brainscape user steven wang. Visit their profile to learn more about the creator.
By:
steven wang
- decks
- flashcards
- learners
Decks in this class (8)
Chapter 1
Suppose we are comparing implemen...,
What is the smallest value of nn ...,
For each function f n and time t ...
3
cards
Chapter 2
Although merge sort runs in theta...,
Use mathematical induction to sho...,
Observe that the while loop of li...
9
cards
Chapter 3
Show that for any real constants ...,
Is 2 n 1 o 2 n 2n 1 o 2n is 2 2n ...,
Prove that the running time of an...
7
cards
Chapter 4
Use the following ideas to develo...,
Pan has discovered a way of multi...,
Show that the solution of t n t n...
28
cards
Chapter 6
14
cards
Chapter 7
9
cards
Chapter 8
15
cards
Chapter 9
14
cards
More about
Algorithm
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study steven wang's Algorithm flashcards now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
Python Data Structures & Algorithms
- 13 decks
- 342 flashcards
- 127 learners
Decks:
Python Built In Data Structures, Python User Defined Data Structures, Python List Methods, And more!
