Algorithms in Computer Science: Search and Sort Techniques

Related lectures (45)

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Covers the complexity analyses of algorithms and their worst-case time complexities.

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Explores sorting methods, insertion sort, and algorithm comparison for efficient data organization.

Covers the complexity analyses of search and sorting algorithms.

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

Explains recursive sorting using Merge Sort and its linearithmic complexity.

Introduces recursion and binary search algorithms for efficient problem-solving.

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.

Explores binary search, merge sort, recursion in algorithms, Fibonacci numbers, and dynamic programming.

Explores Merge Sort, a sorting algorithm that divides, conquers, and combines arrays efficiently to achieve O(nlog n) time complexity.

Introduces Matlab basics, error handling, and billiards project concepts.

Discusses image processing techniques, focusing on seam carving and pixel manipulation in Python programming.

Introduces a programming course for engineers, emphasizing the importance of mastering multiple languages for future projects.

Explores algorithmic complexity, visualization of functions, and algorithm efficiency analysis using Python.

Page 1 of 3