Phyllotaxis and More on Genetic Algorithms
Explore algorithmic botany and genetic algorithms through coding challenges, covering phyllotaxis, fitness functions, selection methods, and ecosystem simulations for creative programming enthusiasts.
Self-Avoiding Walk
Visualize and implement a self-avoiding walk algorithm in JavaScript using p5.js, exploring basic implementation and advanced techniques like backtracking for space-filling walks.
Tic Tac Toe AI with Minimax
Learn to implement an unbeatable Tic Tac Toe AI using the minimax algorithm. Explore game setup, algorithm implementation, and potential improvements in this hands-on coding tutorial.
Tower of Hanoi in Python
Learn to solve the Tower of Hanoi puzzle using Python, covering concepts like dynamic programming and recursion. Gain practical coding skills and understand complexity analysis.
Greedy Programming in Java
Learn greedy programming in Java, covering concepts, examples, and implementations of Fractional Knapsack and Prim's Algorithm for minimal spanning trees. Gain practical skills in solving optimization problems efficiently.
Advent of Code: Solving Problems 9-11 - Tips and Tricks
Explore Python solutions for Advent of Code problems 9-11. Learn methodologies, tips, and tricks for tackling complex algorithmic challenges and improving your programming skills.
A Solution to the Stable Marriage Problem - Emily Riehl Public Lecture
Explore the mathematics behind the stable marriage problem, its sexist implications, and real-world applications in this engaging lecture by mathematician Emily Riehl.
LeetCode Exercise in Java - Longest Substring Without Repeating Characters - Fast Solution
Learn to solve LeetCode's longest substring problem in Java, from brute force to optimized solutions. Gain insights into efficient problem-solving techniques and improve your coding skills.
Infix to Postfix Conversion and Vice Versa Without Using Stack - With Solved Examples - Data Structures
Learn manual conversion between infix and postfix expressions without using stacks. Includes step-by-step examples for both directions, enhancing understanding of expression notation and operator precedence.
Infix to Prefix Conversion and Vice Versa Without Using Stack - With Solved Examples - Data Structures
Learn manual conversion between infix and prefix expressions without stacks. Includes step-by-step examples for both directions, enhancing understanding of expression notation in data structures.
Learn Divide & Conquer Algorithms - Great Learning
Explore divide and conquer algorithms: Binary Search, Quick Sort, and Merge Sort. Learn concepts, implementations, and complexities in this comprehensive session on efficient problem-solving techniques.
Catalytic Approaches to the Tree Evaluation Problem
Explore catalytic approaches to the Tree Evaluation Problem, including pebbling games and catalytic space. Learn about multiplication lemmas and formulas for TEP.
Solving an Impossible Riddle with Code
Explore Python coding to simulate and solve the 100 prisoner riddle, comparing random and loop strategies through data visualization and network analysis.
A Complete Overview of Quicksort - Data Structures & Algorithms
Comprehensive exploration of quicksort algorithm, covering implementation, time complexity, and optimization techniques for efficient data sorting.
Computation of Reeb Graphs in a Semi-Algebraic Setting
Explore semi-algebraic geometry in applied topology, focusing on Reeb graphs and spaces. Learn about an efficient algorithm for computing semi-algebraic descriptions of Reeb graphs.
Binary Search with Example
Learn efficient array searching techniques with binary search, reducing search space for faster implementation compared to linear search. Includes practical examples.
Waring Rank, Parameterized and Exact Algorithms
Explore Waring rank and its applications in parameterized and exact algorithms, gaining insights into computational complexity and problem-solving techniques.
Graph Algorithms and Coding - Session 4C
Explore advanced graph algorithms and coding techniques in this IEEE session, focusing on cutting-edge research and practical applications in computer science.
Puzzles, Problems, and Programs
Explore mental model alignment in puzzles, problems, and programming through interactive techniques and informative failure, enhancing cognitive abilities and problem-solving skills.
Learning to Fly
Explore the journey of developing autonomous flying machines, from initial coding to creating a complete system capable of navigating unfriendly environments safely and efficiently.
Information, Computation, Optimization - Connecting the Dots in the Traveling Salesman Problem
Explore optimization techniques and their applications in solving complex problems like the Traveling Salesman, with insights from William Cook's research and real-world examples.