* feat : Implemented Inverse Fast Fourier Transform
Slightly different from fast Fourier transform
Just the om variable declared in line 40 is divided by n
and swapping the testing inputs with testing outputs .
* Update numerical_methods/Inverse_fast_fourier_transform.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update numerical_methods/Inverse_fast_fourier_transform.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update numerical_methods/Inverse_fast_fourier_transform.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* formatting filenames d7f9a946
* updating DIRECTORY.md
* fix : optimized the code
* Apply suggestions from code review
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Ayaan Khan <ayaankhan98@gmail.com>
* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
* Rewrote node struct and file structure
* Added Circular Linked List
* Update doc
* Wrote bulk of code, added documentation
* clang-format and clang-tidy fixes for 06f11f1e
* Update operations_on_datastructures/circular_linked_list.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/circular_linked_list.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* clang-format and clang-tidy fixes for 25ed3ea0
* Added parameter documentation
* Added destructor for CircularLinkedList
* Fixed memory bug
* Update circular_linked_list.cpp
* Update circular_linked_list.cpp
* Added move constructor and assignment operator
* clang-format and clang-tidy fixes for b36e4736
* Fixed copy and move operators/constructors and added documentation
* clang-format and clang-tidy fixes for 24d3b9c2
* Added missing returns
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com>
* fix: rewrite prime numbers using linear sieve
* fix code scanning error
* clang-format and clang-tidy fixes for 0afd463b
* fix sign-compare warning
* clang-format and clang-tidy fixes for 6ddff0f7
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* [feat/fix/docs]: Improvements in the...
...`backtracking` folder, and minor fixes in the `others/iterative_tree_traversals.cpp` and the `math/check_prime.cpp` files.
* clang-format and clang-tidy fixes for 9cc3951d
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com>
* Create reverse_binary_tree.cpp
* Added documentation
Added Documentation for the level_order_traversal() function, and implemented a print() function to display the tree to STDOUT
* Added documentation
* Renamed tests to test
* Fixed issue with incorrect using statement
* updating DIRECTORY.md
* clang-format and clang-tidy fixes for fb86292d
* Added Test cases
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Update operations_on_datastructures/reverse_binary_tree.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* Changed int to int64_t
* Updated documentation wording
* Rewrote array_left_rotation
* Modified doc, fixed bug in shifting logic
Fixed a mistake that would cause the array to shift incorrectly
* clang-format and clang-tidy fixes for bd135686
* Update operations_on_datastructures/array_left_rotation.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
* changed int to size_t
* clang-format and clang-tidy fixes for 00e7daaf
* clang-format and clang-tidy fixes for ed2aa3a7
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: David Leal <halfpacho@gmail.com>
Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com>
