mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-10 14:05:17 +08:00
f821fae698
* Add files via upload # Class Based DSU -Using Path Compression to get the best time complexity O(1) -Using Union Rank to keep track of changes using parent(p) O(logN) * Class based DSU : Path Compression O(1) and Union Rank O(logN) * made changes to satisfy the meets of the PR changes made to satisfy the needs of the PR - used base lib instead of <bits/stdc++.h> - changed all stdin's and included pre-declared test cases * removed stdin for testing * changed file name from upper case to lower case * made necessary changes * Delete DSU_union_rank.cpp * Delete DSU_path_compresssion.cpp * added explicit to contructors, return 0, n=dec * Delete dsu_path_compresssion.cpp * added documentations, to match the typical structure Added @brief @details @author @param @returns * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * added self-implementation test cases, changed int to uint64_t * std::cout after assert * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * updating DIRECTORY.md * clang-format and clang-tidy fixes forb8c37d09* Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * documentation changes * Update dsu_union_rank.cpp * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * clang-format and clang-tidy fixes for18843179* Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_path_compression.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> * clang-format and clang-tidy fixes for5c24d9a9* Update data_structures/dsu_union_rank.cpp Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: David Leal <halfpacho@gmail.com> Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Abhinn Mishra <49574460+mishraabhinn@users.noreply.github.com> Co-authored-by: Ayaan Khan <ayaankhan98@gmail.com>
The Algorithms - C++
Overview
This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.
Features
- The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++.
- Well documented source code with detailed explanations provide a valuable resource for educators and students alike.
- Each source code is atomic using STL classes and no external libraries are required for their compilation and execution. Thus, the fundamentals of the algorithms can be studied in much depth.
- Source codes are compiled and tested for every commit on the latest versions of three major operating systems viz., Windows, MacOS and Ubuntu (Linux) using MSVC 16 2019, AppleClang 11.0 and GNU 7.5.0 respectively.
- Strict adherence to C++11 standard ensures portability of code to embedded systems as well like ESP32, ARM Cortex, etc. with little to no changes.
- Self-checks within programs ensure correct implementations with confidence.
- Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.
Documentation
Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.