Skip to content

GatzZ/Algorithms-DPV

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

24 Commits

.idea

.idea

 
 

.ipynb_checkpoints

.ipynb_checkpoints

 
 

data

data

 
 

2. Add Two Numbers.py

2. Add Two Numbers.py

 
 

29. divide two Integers.py

29. divide two Integers.py

 
 

29_divide_two_Integers.ipynb

29_divide_two_Integers.ipynb

 
 

2_Add Two Numbers.ipynb

2_Add Two Numbers.ipynb

 
 

3. Longest Substring Without Repeating Characters.py

3. Longest Substring Without Repeating Characters.py

 
 

DFS.py

DFS.py

 
 

README.md

README.md

 
 

Sorting.ipynb

Sorting.ipynb

 
 

Test_assignment.ipynb

Test_assignment.ipynb

 
 

bipartie_matching_hungarian_method.py

bipartie_matching_hungarian_method.py

 
 

boyer_moore.py

boyer_moore.py

 
 

brute_force_substring.py

brute_force_substring.py

 
 

decomposition_of_graph.ipynb

decomposition_of_graph.ipynb

 
 

edit_distance.py

edit_distance.py

 
 

graph.py

graph.py

 
 

heap.py

heap.py

 
 

huffman.py

huffman.py

 
 

iterative_mergesort.py

iterative_mergesort.py

 
 

kmp_substring.py

kmp_substring.py

 
 

kruskal.py

kruskal.py

 
 

largest_subsequence_sum.py

largest_subsequence_sum.py

 
 

least_matrix_multipication_times.py

least_matrix_multipication_times.py

 
 

longest_common_substring.py

longest_common_substring.py

 
 

longest_increasing_subsequence.py

longest_increasing_subsequence.py

 
 

max_flow.py

max_flow.py

 
 

mit_graph.py

mit_graph.py

 
 

mutiplication_divide_and_conquer.ipynb

mutiplication_divide_and_conquer.ipynb

 
 

paths_in_graphs.ipynb

paths_in_graphs.ipynb

 
 

polynomial_multiplication_and_FFT.ipynb

polynomial_multiplication_and_FFT.ipynb

 
 

prim.py

prim.py

 
 

rabin_karp.py

rabin_karp.py

 
 

regular_expression.py

regular_expression.py

 
 

selection.py

selection.py

 
 

stack_DFS.py

stack_DFS.py

 
 

string_interview.py

string_interview.py

 
 

tools.py

tools.py

 
 

Repository files navigation

Algorithms-DPV

0 Prologue

1 Algorithms with numbers

2 Divide-and-conquer algorithms

3 Decompositions of graphs

4 Paths in graphs

5 Greedy algorithms

6 Dynamic programming

7 Linear programming and reductions

8 NP-complete problems

9 Coping with NP-completeness

10 Quantum algorithms

About

Code for DPV

Resources

Readme
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages