Title: Non-Python liveProjects
These are self-paced projects where you work on building a "real world" application. These are the non-Python liveProjects that I wrote. For a list of the Python liveProjects, click here.
- Six Small Algorithm Projects with C#
- This series includes the Trees, Shortest Paths, Scheduling, Image Processing, Work Assignment, and Fractals liveProjects.
- Algorithm Projects with C#: Trees
- Nodes, traversals, exhaustive search, drawing, org charts, sorted trees
- Algorithm Projects with C#: Shortest Paths
- Nodes, links, saving and restoring networks, label setting, label correcting
- Algorithm Projects with C#: Scheduling
- Topological sorting, PERT charts, critical paths, Gantt charts
- Algorithm Projects with C#: Image Processing
- Geometry, point operations, enhancements, image ops, filters, custom kernels, special
- Algorithm Projects with C#: Work Assignment
- Generating test networks, maximal flow, assigning jobs
- Algorithm Projects with C#: Fractals
- Recursive line-drawing fractals, strange attractors, escape time fractals
- Four Small Algorithm Projects with Rust
- This series includes the Sorting and Searching, Problem-Solving with Recursion, Public Key Cryptography, and Dynamic Programming liveProjects.
- Algorithm Projects with Rust: Sorting and Searching
- Generating random numbers, Bubble Sort, QuickSort, counting sort, linear search, binary search, simple recursion.
- Algorithm Projects with Rust: Problem-Solving with Recursion
- Recursion, simple dynamic programming, memoization, backtracking, restructuring problems, calculating factorials and Fibonacci numbers, finding knight's tours, solving the n-queens problem, solving the Tower of Hanoi puzzle.
- Public Key Cryptography
- Randomization, GCD and LCM, fast exponentiation, working with prime numbers, factoring, primality testing, RSA encryption.
- Algorithm Projects with Rust: Dynamic Programming
- Exhaustive search, backtracking, branch and bound, complex dynamic programming.
- Six Small Algorithm Projects with Go
- This series includes the Sorting and Searching, Linked Data Structures, Problem-Solving with Recursion, Lookups with Hash Tables, Public Key Cryptography with RSA, and the Knapsack Problem liveProjects.
- Go Algorithms: Sorting and Searching
- Bubblesort, quicksort, counting sort, linear search, binary search, simple recursion.
- Go Algorithms: Linked Data Structures
- Sentinels, singly linked lists, doubly linked lists, deques, tree traversal, sorted binary trees, recursion.
- Go Algorithms: Problem-Solving with Recursion
- Recursion, simple dynamic programming, memoization, backtracking, restructuring problems, calculating factorials and Fibonacci numbers, finding knight's tours, solving the N-queens problem, solving the Tower of Hanoi puzzle.
- Go Algorithms: Lookups with Hash Tables
- Chaining, linear probing, quadratic probing, double hashing.
- Go Algorithms: Public Key Cryptography with RSA
- Randomization, GCD and LCM, fast exponentiation, working with prime numbers, factoring, primality testing, RSA encryption.
- Go Algorithms: The Knapsack Problem
- Exhaustive search, backtracking, branch and bound, Rod's technique, dynamic programming.
|