hashing

• 6 results
• <
• >

sort by: Relevancy | Title try advanced search for more options

1. 

   Hashing II

   MIT / Computer Science
   Charles E. Leiserson
   

2. 

   Hashing I

   MIT / Computer Science
   Charles E. Leiserson
   

3. 

   Computer Science III: Programming Paradigms

   Stanford / Computer Science
   Jerry Cain
   

   Topics include: Advanced memory management features of C and C++; the differences between imperative and object-oriented paradigms; the functional paradigm (using LISP) and concurrent programming (using C and C++); brief survey of other modern languages such as Python, Objective C, and C#. Prerequisites: Programming and problem solving at the Programming Abstractions level. Prospective students should know a reasonable amount of C++. Yo...more

4. 

   Introduction to Algorithms

   MIT / Computer Science
   Charles E. Leiserson
   

   This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

5. 

   Hashing

   Berkeley / Computer Science
   Paul Hilfinger
   

6. 

   Compare Map Implementations

   Stanford / Computer Science
   Julie Zelenski
   

   Compare Map Implementations, Hashtable Idea, Hash Functions, Hash Collisions, Live Demo: Hashing, Live Coding: Hashing, Hashing Idea : Example in Real World, Hash Table Performance, Compare Map Implementations, Hashing Generic Types, Implementing Set