Skip to content

ValRCS/RTU_Algorithms_DIP321

Repository files navigation

RTU_Algorithms_DIP321

RTU DITF

RTU

Offered

  • Spring 2021
  • Spring 2022
  • Spring 2023
  • Spring 2024
  • Spring 2025
  • Spring 2026

Google Colab Notebooks

The links below open the preferred notebook versions in Google Colab. When near-duplicate notebooks exist, the newest refined notebook is listed, with underscore-style filenames preferred where appropriate.

Foundations

  • Open In Colab Introduction to Algorithms
  • Open In Colab Greatest Common Divisor
  • Open In Colab General Problem Solving

Recursion and Sorting

  • Open In Colab Recursion Examples
  • Open In Colab Sorting Algorithms Introduction
  • Open In Colab Sorting Continued

Divide and Conquer

  • Open In Colab Master Theorem
  • Open In Colab Maximum Subarray Problem

Algorithmic Design Techniques

  • Open In Colab Greedy Algorithms
  • Open In Colab Dynamic Programming
  • Open In Colab Robbie Dynamic Programming Example
  • Open In Colab N Queens Backtracking
  • Open In Colab Sudoku Solver by Backtracking
  • Open In Colab Branch and Bound

Probabilistic Analysis

  • Open In Colab Randomized Algorithms

Graph Algorithms

  • Open In Colab Dijkstra's Algorithm
  • Open In Colab A* Algorithm
  • Open In Colab Bellman-Ford Algorithm
  • Open In Colab Floyd-Warshall All-Pairs Shortest Paths
  • Open In Colab Minimal Spanning Tree Algorithms
  • Open In Colab Max Flow / Min Cut

Optimization and Linear Programming

  • Open In Colab Linear Programming
  • Open In Colab Beyond Linear Programming

Parsing and Strings

  • Open In Colab Parsing Algorithms and Abstract Syntax Trees
  • Open In Colab String Matching Algorithms

About

Algorithms Course DIP321 at Riga Technical University

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors