Learn · Data Structures and Algorithms Design
Lecture 6 of 40Week 2
Lecture 06: Local Minima in 1D
Prof. Nitin Saxena · IIT Kanpur
Credits and licence
- From
- Data Structures and Algorithms Design, IIT Kanpur (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 01: What is an Algorithm?
- Lecture 02: Efficient Algorithms
- Lecture 03: Sorting, Searching and Arrays
- Lecture 04: Clever Algorithms
- Lecture 05: Asymptotics, Fast Max-Sum Subarray
- Lecture 06: Local Minima in 1D
- Lecture 07: Local Minima in 2D
- Lecture 08: Efficient Local Minima in 2D
- Lecture 09: Recurrence & Efficient Data Structures
- Lecture 10: Range Minima in 1D array
- Lecture 11: Abstract Data Structures: Lists
- Lecture 12: Linked Lists
- Lecture 13: Binary Search Inspired Tree
- Lecture 14: BST : Search, Insertion
- Lecture 15: Balancing a BST, Stack Data Structure
- Lecture 16: Stack: Expression Evaluation
- Lecture 17: Queue DS
- Lecture 18: Red Black Tree DS
- Lecture 19: RB Tree: Balance
- Lecture 20: Divide and Conquer Paradigm
- Lecture 21: Integer Multiplication & Inversions
- Lecture 22: Graph Theory & Algorithms
- Lecture 23: Graph DS & Breadth First Search
- Lecture 24: Complexity & Applications of BFS
- Lecture 25: Check Bipartiteness using BFS, Depth First Search
- Lecture 26: DFS tree and biconnected graph
- Lecture 27: Articulation Points, Heap Data Structure
- Lecture 28: Binary Heap
- Lecture 29: Heapification
- Lecture 30: Augmented tree Data Structure
- Lecture 31: Multi Increment and Dynamic Range Min Problems
- Lecture 32: Disjoint-Set Data Structure
- Lecture 33: Fast Union and the i-th Statistic Problem
- Lecture 34: i-th Statistic Problem: Approx Median
- Lecture 35: Greedy Algorithms: Job Scheduling
- Lecture 36: Minimum Spanning Tree
- Lecture 37: MST Cycle, Mobile Towers
- Lecture 38: Shortest Path Algorithm
- Lecture 39: Djikstra's Algorithm
- Lecture 40: Counting Sort, Radix Sort