Selection algorithm

Formal sciences
Theoretical computer science
Algorithms and data structures
Analysis of algorithms

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (28)

Page 2 of 3

Selection Sort: Implementation and Exercise

Explains the implementation of the selection sort algorithm and provides a detailed walkthrough.

Solving Connect Four: A-B Pruning and Monte-Carlo Tree Search

Explores solving Connect Four using game theory algorithms and compares their efficiency.

Randomized Algorithms: Median Search

Explores how randomness and recursion can be used to efficiently find the median of a list.

Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search

Explores solving Connect Four using game theory algorithms and compares their performance.

Discussion of Complexity

Explores worst-case complexity in computer science and the importance of real-life complexity in algorithm selection.

Graph Algorithms: BFS and DFS

Explores graph algorithms like BFS and DFS, discussing shortest paths, spanning trees, and data structures' role.

Column Subset Selection: RRQR and TCS

Explores RRQR, TCS, tradeoffs, accuracy metrics, and low-rank matrix factorization frameworks, emphasizing communication avoidance and recent developments.

Solving Linear Systems with Matrices

Explains solving linear systems with matrices and conditions for infinite solutions.

Quicksort: Expected Running Time and Decision Tree

Discusses the expected running time of randomized quicksort and decision trees as an abstraction of comparison sorts.

Selection Sort: Efficiency and Complexity

Explores the efficiency and complexity of the selection sort algorithm compared to other sorting methods.