mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
17405a05ee
* feat: add spare table data structure
Added implementation of sparse table for a 'duplicate invariant function'. Implementation of min(a1,a2...,aN) being the duplicate invariant function is done.
* fixed: clang-tidy warnings
* minor change: remove bits/stdc++ header
* added header comments
* updating DIRECTORY.md
* fixed to clang-format
* fixed header postion
suggested change
Co-authored-by: David Leal <halfpacho@gmail.com>
* fixed author name
suggested changes
Co-authored-by: David Leal <halfpacho@gmail.com>
* fixed test() info to Doxygen standards.
suggested changes
Co-authored-by: David Leal <halfpacho@gmail.com>
* changed comment
suggested changes
Co-authored-by: David Leal <halfpacho@gmail.com>
* minor changes in file info
suggested changes
Co-authored-by: David Leal <halfpacho@gmail.com>
* minor changes in file info
suggested changes
Co-authored-by: David Leal <halfpacho@gmail.com>
* minor changes in file info
suggested changes
Co-authored-by: David Leal <halfpacho@gmail.com>
* changes in variable and struct descriptions
* Update data_structures/sparse_table.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/sparse_table.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/sparse_table.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* changed int data type for non-negative numbers
* changing datatypes of certain variables
* Update data_structures/sparse_table.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update data_structures/sparse_table.cpp
Co-authored-by: Ayaan Khan <ayaankhan98@gmail.com>
* clang-format and clang-tidy fixes for
|
||
|---|---|---|
| .. | ||
| cll | ||
| avltree.cpp | ||
| binary_search_tree2.cpp | ||
| binary_search_tree.cpp | ||
| binaryheap.cpp | ||
| circular_queue_using_linked_list.cpp | ||
| CMakeLists.txt | ||
| disjoint_set.cpp | ||
| doubly_linked_list.cpp | ||
| linked_list.cpp | ||
| linkedlist_implentation_usingarray.cpp | ||
| list_array.cpp | ||
| morrisinorder.cpp | ||
| queue_using_array2.cpp | ||
| queue_using_array.cpp | ||
| queue_using_linked_list.cpp | ||
| queue_using_linkedlist.cpp | ||
| queue_using_two_stacks.cpp | ||
| queue.h | ||
| rb_tree.cpp | ||
| skip_list.cpp | ||
| sparse_table.cpp | ||
| stack_using_array.cpp | ||
| stack_using_linked_list.cpp | ||
| stack.h | ||
| student.txt | ||
| test_queue.cpp | ||
| test_stack_students.cpp | ||
| test_stack.cpp | ||
| tree_234.cpp | ||
| tree.cpp | ||
| trie_modern.cpp | ||
| trie_tree.cpp | ||
| trie_using_hashmap.cpp | ||