Skip to content

timothyshull/tools_to_remember

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
resources
resources
 
 
.gitignore
.gitignore
 
 
Adj_matrix_edge_weighted_digraph.cpp
Adj_matrix_edge_weighted_digraph.cpp
 
 
Adj_matrix_edge_weighted_digraph.h
Adj_matrix_edge_weighted_digraph.h
 
 
Bellman_ford.cpp
Bellman_ford.cpp
 
 
Bellman_ford.h
Bellman_ford.h
 
 
Binary_search_st.h
Binary_search_st.h
 
 
Bipartite.cpp
Bipartite.cpp
 
 
Bipartite.h
Bipartite.h
 
 
Bloom_filter.cpp
Bloom_filter.cpp
 
 
Bloom_filter.h
Bloom_filter.h
 
 
Boruvka_mst.cpp
Boruvka_mst.cpp
 
 
Boruvka_mst.h
Boruvka_mst.h
 
 
Breadth_first_paths.cpp
Breadth_first_paths.cpp
 
 
Breadth_first_paths.h
Breadth_first_paths.h
 
 
Bst.h
Bst.h
 
 
CMakeLists.txt
CMakeLists.txt
 
 
Connected_component.cpp
Connected_component.cpp
 
 
Connected_component.h
Connected_component.h
 
 
Cycle.cpp
Cycle.cpp
 
 
Cycle.h
Cycle.h
 
 
Depth_first_order.cpp
Depth_first_order.cpp
 
 
Depth_first_order.h
Depth_first_order.h
 
 
Depth_first_paths.cpp
Depth_first_paths.cpp
 
 
Depth_first_paths.h
Depth_first_paths.h
 
 
Depth_first_search.cpp
Depth_first_search.cpp
 
 
Depth_first_search.h
Depth_first_search.h
 
 
Dfs_edge_classification.h
Dfs_edge_classification.h
 
 
Digraph.cpp
Digraph.cpp
 
 
Digraph.h
Digraph.h
 
 
Dijkstra_sp.cpp
Dijkstra_sp.cpp
 
 
Dijkstra_sp.h
Dijkstra_sp.h
 
 
Directed_cycle.cpp
Directed_cycle.cpp
 
 
Directed_cycle.h
Directed_cycle.h
 
 
Directed_dfs.cpp
Directed_dfs.cpp
 
 
Directed_dfs.h
Directed_dfs.h
 
 
Directed_edge.cpp
Directed_edge.cpp
 
 
Directed_edge.h
Directed_edge.h
 
 
Directed_eulerian_cycle.cpp
Directed_eulerian_cycle.cpp
 
 
Directed_eulerian_cycle.h
Directed_eulerian_cycle.h
 
 
Edge.cpp
Edge.cpp
 
 
Edge.h
Edge.h
 
 
Edge_weighted_digraph.cpp
Edge_weighted_digraph.cpp
 
 
Edge_weighted_digraph.h
Edge_weighted_digraph.h
 
 
Edge_weighted_directed_cycle.cpp
Edge_weighted_directed_cycle.cpp
 
 
Edge_weighted_directed_cycle.h
Edge_weighted_directed_cycle.h
 
 
Edge_weighted_graph.cpp
Edge_weighted_graph.cpp
 
 
Edge_weighted_graph.h
Edge_weighted_graph.h
 
 
Eulerian_cycle.cpp
Eulerian_cycle.cpp
 
 
Eulerian_cycle.h
Eulerian_cycle.h
 
 
Flow_edge.cpp
Flow_edge.cpp
 
 
Flow_edge.h
Flow_edge.h
 
 
Flow_network.cpp
Flow_network.cpp
 
 
Flow_network.h
Flow_network.h
 
 
Floyd_warshall.cpp
Floyd_warshall.cpp
 
 
Floyd_warshall.h
Floyd_warshall.h
 
 
Ford_fulkerson.cpp
Ford_fulkerson.cpp
 
 
Ford_fulkerson.h
Ford_fulkerson.h
 
 
Graham_scan.cpp
Graham_scan.cpp
 
 
Graham_scan.h
Graham_scan.h
 
 
Graph.cpp
Graph.cpp
 
 
Graph.h
Graph.h
 
 
Hamiltonian_path.h
Hamiltonian_path.h
 
 
Huffman_code.cpp
Huffman_code.cpp
 
 
Huffman_code.h
Huffman_code.h
 
 
Index_min_pq.h
Index_min_pq.h
 
 
Kosaraju_sharir_scc.cpp
Kosaraju_sharir_scc.cpp
 
 
Kosaraju_sharir_scc.h
Kosaraju_sharir_scc.h
 
 
Kruskal_mst.cpp
Kruskal_mst.cpp
 
 
Kruskal_mst.h
Kruskal_mst.h
 
 
Linear_probing_hash_st.h
Linear_probing_hash_st.h
 
 
Lru_cache.h
Lru_cache.h
 
 
Point_2d.cpp
Point_2d.cpp
 
 
Point_2d.h
Point_2d.h
 
 
Prim_mst.cpp
Prim_mst.cpp
 
 
Prim_mst.h
Prim_mst.h
 
 
README.md
README.md
 
 
Red_black_bst.h
Red_black_bst.h
 
 
Separate_chaining_hash_st.h
Separate_chaining_hash_st.h
 
 
Sequential_search_st.h
Sequential_search_st.h
 
 
String_tokenizer.h
String_tokenizer.h
 
 
Topological.cpp
Topological.cpp
 
 
Topological.h
Topological.h
 
 
Transitive_closure.cpp
Transitive_closure.cpp
 
 
Transitive_closure.h
Transitive_closure.h
 
 
Tree_node.h
Tree_node.h
 
 
Union_find.cpp
Union_find.cpp
 
 
Union_find.h
Union_find.h
 
 
adj_matrix_edge_weighted_digraph_spec.cpp
adj_matrix_edge_weighted_digraph_spec.cpp
 
 
all.md
all.md
 
 
binary_search.cpp
binary_search.cpp
 
 
bubble_sort.cpp
bubble_sort.cpp
 
 
bucket_sort.cpp
bucket_sort.cpp
 
 
coin_change.cpp
coin_change.cpp
 
 
combinations.cpp
combinations.cpp
 
 
combinations_k.cpp
combinations_k.cpp
 
 
combinations_klex.cpp
combinations_klex.cpp
 
 
counting_sort.cpp
counting_sort.cpp
 
 
cut_rod.cpp
cut_rod.cpp
 
 
deadlock_cycle.cpp
deadlock_cycle.cpp
 
 

Repository files navigation

Tools to Remember

This repo reflects what I view as a good set of algorithms to be aware of for C++ interviews. There is a subset of the code here that should be second nature, e.g.:

  • binary search
  • quicksort
  • tree printing
  • graph and tree traversal
  • cycles in graphs
  • topological sort

Additionally, combinations, permutations, and partitions are good to know.

Some of this code is adapted from Robert Sedgewick's work, some from a handful of other sources, and some is my own original work. All of it has been modified by me, either to clean it up, or to port it from another language to C++.

Please note - this project is a work in progress and will be cleaned up and tested over time.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages