Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Introduction to Algorithms: Basics and Importance
Graph Chatbot
Related lectures (28)
Introduction to Algorithms: Course Overview and Basics
Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.
Graphs: Properties and Representations
Covers graph properties, representations, and traversal algorithms using BFS and DFS.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Algorithms: Summary of the week
Covers algorithms for searching, sorting, optimization, and the Halting Problem.
Recursion and Binary Search
Introduces recursion and binary search algorithms for efficient problem-solving.
Optimization Algorithms: Greedy Approach
Explores optimization problems and greedy algorithms for efficient decision-making.
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Searching Algorithms: Linear and Binary Search
Covers linear and binary search algorithms for locating items in lists.
Searching Algorithms: Linear and Binary Search
Covers linear and binary search algorithms for locating items in a list.
Complexity Analyses: Linear and Binary Search, Sorting Algorithms
Covers the complexity analyses of search and sorting algorithms.
Merge Sort: Sorting Algorithm
Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.
Complexity & Induction: Algorithms & Proofs
Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.
Automorphism groups: Trees and Graphs
Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.
Automorphism groups of trees and graphs
Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.
Exploring Car Data Analysis
Explores car data analysis using Python programming for tasks like file handling, dictionary creation, and attribute analysis.
Environmental Impact and Efficiency
Delves into environmental impact, efficiency, IPAT formula, Kaya decomposition, decoupling, and rebound effect in various sectors.
Translation of for
Explains the translation of for-expressions in Scala using map, flatmap, and filter functions, with examples and a discussion on its generalization to different types.
Common Sequences Operations
Covers common operations on sequences like lists and tuples, including slicing, extending, and replacing elements.
Comparing Tangent Vectors: Three Reasons Why
Explores the importance of comparing tangent vectors at different points using algorithms and finite differences.
Algorithms in Computer Science: Search and Sort Techniques
Log in to Mediaspace to watch this video
Provides an overview of essential search and sort algorithms in computer science.
Previous
Page 1 of 2
Next
