Commit Graph

6 Commits

Author SHA1 Message Date
Serg Gini
9ff7468e9e D solutions (#305)
* Added 1 and 2 chapters

for D lang

* [D] Added recursion code

All examples were ported from the Python code directly to D.
Naming convention of Dlang is not allowing to run code files, which started with numbers. To run examples rename the files

* [D] quicksort code

* [D] Added hashtable example

Based on the Python code

* Create 01_breadth_first_search.d

Added D example for breadth-first search

* Create 01_filesystem_dfs.d

Filesystem example in D

* Create 01_dijkstras_algorithm.d

Added Dijkstras algorithm implementation for D

* Create 01_set_covering.d

Added greedy algorythm for D

* Create 01_longest_common_sub.d

Added dynamic programming example for D language.
The code is based on Rust example

* Added modules definition

Required to run code with names starting with numbers

* Fixed proper unsigned handling
2025-05-01 18:24:42 -05:00
Artem Chernyak
93a7b227b3 add dijkstra's algorithm in rust (#294) 2024-12-07 07:36:57 -06:00
Renan Duarte Leal
add60334fb Add Dijkstra's algorithm to Typescript (#291) 2024-12-07 07:34:16 -06:00
Paolo Grisoli
8a13efde83 Update examples for Zig (#287)
* update zig in chapters 1-6

* fix zig dijkstras algo

* fix zig greedy algo

* fix longest_common_subsequence in zig

* cleanup

* test: use testing allocator
2024-12-07 07:29:48 -06:00
Mikhail
cf6b035069 Add Dijkstra's algorithm to Kotlin (#268) 2024-03-22 14:50:11 -05:00
Aditya Bhargava
933acafaf3 reorg and add code for second edition 2023-08-09 08:20:19 -05:00