{"id":13680599,"url":"https://github.com/Thuva4/Algorithms","last_synced_at":"2025-04-30T00:30:38.753Z","repository":{"id":25700557,"uuid":"105735897","full_name":"thuva4/Algorithms","owner":"thuva4","description":"Collection of algorithms in multiple programming languages.","archived":false,"fork":false,"pushed_at":"2023-09-30T22:48:09.000Z","size":1603,"stargazers_count":495,"open_issues_count":8,"forks_count":545,"subscribers_count":19,"default_branch":"master","last_synced_at":"2025-04-10T05:40:57.777Z","etag":null,"topics":["algorithms","algorithms-implemented","clustering-algorithm","fast-algorithm","hacktoberfest","multiple-algorithms","search-algorithm"],"latest_commit_sha":null,"homepage":"https://thuva4.github.io/Algorithms/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/thuva4.png","metadata":{"files":{"readme":"README-CN.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":"SECURITY.md","support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2017-10-04T05:51:01.000Z","updated_at":"2025-03-01T23:53:34.000Z","dependencies_parsed_at":"2024-01-14T04:41:44.074Z","dependency_job_id":"840393ca-7ce6-4340-bcd5-f1e124b5ea03","html_url":"https://github.com/thuva4/Algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thuva4%2FAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thuva4%2FAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thuva4%2FAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thuva4%2FAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thuva4","download_url":"https://codeload.github.com/thuva4/Algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":251607274,"owners_count":21616731,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","algorithms-implemented","clustering-algorithm","fast-algorithm","hacktoberfest","multiple-algorithms","search-algorithm"],"created_at":"2024-08-02T13:01:19.099Z","updated_at":"2025-04-30T00:30:35.816Z","avatar_url":"https://github.com/thuva4.png","language":"C++","funding_links":[],"categories":["C++"],"sub_categories":[],"readme":"# 算法实例\n\n[![DeepScan grade](https://deepscan.io/api/teams/6243/projects/8132/branches/92442/badge/grade.svg)](https://deepscan.io/dashboard#view=project\u0026tid=6243\u0026pid=8132\u0026bid=92442)\n\n这个仓库包含各种各样的，由不同的编程语言实现的算法实例。\n\n## 不同语言的算法实现\n\n\n语言 | C++ | Python | Java | JavaScript | C | Go | C# | Ruby | Swift | Scala | Haskell | Kotlin | Rust | Perl | BrainFuck | Crystal | Racket | \n|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|:---:|\nFibonacci | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | \nBubbleSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   |   | :+1: | :+1: | :+1: |   |   | \nLinearSearch | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: |   | :+1: | :+1: | :+1: |   |   | :+1: | \nInsertionSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: |   |   |   |   | \nQuickSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: |   |   |   |   | \nBinarySearch | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   |   | :+1: |   | :+1: |   |   |   | \nMergeSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   | \nGreatestCommonDivisor | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   | :+1: |   |   |   |   |   | \nSelectionSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   |   | :+1: |   |   |   |   | \nDoomsday | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: | :+1: |   |   | :+1: |   |   |   |   |   | \nHeapSort | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   |   |   |   |   |   |   | :+1: |   | \nXorSwap | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   | :+1: | :+1: |   |   |   |   |   |   |   | \nFactorial | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   | :+1: |   |   |   |   | \nHammingDistance | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   | \nKadanes | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   | \nFisherYatesShuffle | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   | \nLongestCommonSubsequence | :+1: | :+1: | :+1: | :+1: | :+1: |   |   | :+1: |   |   |   |   |   |   |   |   |   | \nDijkstras | :+1: | :+1: | :+1: | :+1: |   | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   | \nCountingSort | :+1: | :+1: | :+1: | :+1: |   |   |   | :+1: | :+1: |   |   |   |   |   |   |   |   | \nDepthFirstSearch | :+1: | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nFastFourierTransform | :+1: | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nFloydsAlgorithm | :+1: | :+1: | :+1: |   | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   | \nRadixSort | :+1: | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nTernarySearch | :+1: | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nBellmanFord | :+1: | :+1: | :+1: |   |   |   | :+1: |   |   |   | :+1: |   |   |   |   |   |   | \nBinaryGCD | :+1: | :+1: | :+1: |   |   | :+1: |   |   |   |   | :+1: |   |   |   |   |   |   | \nShellSort | :+1: | :+1: | :+1: | :+1: |   |   |   | :+1: |   |   |   |   |   |   |   |   |   | \nExtendedEuclidean | :+1: | :+1: |   | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nSegmentedSieve | :+1: | :+1: | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nBreadthFirstSearch | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   | \nFloodFill | :+1: | :+1: | :+1: |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   | \nLongestIncreasingSubsequence | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   | \nUnaryCoding | :+1: | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   | \nQuickSelect |   | :+1: | :+1: | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   | \nSieveOfEratosthenes |   | :+1: | :+1: | :+1: |   |   |   |   |   |   | :+1: |   |   |   |   |   |   | \nBitonicSort | :+1: |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nPrimeCheck | :+1: | :+1: |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nSieveofEratosthenes | :+1: |   |   |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   | \nSwap |   |   |   |   | :+1: | :+1: |   |   |   | :+1: |   |   |   |   |   |   |   | \nUnionFind |   | :+1: | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nBorweinsAlgorithm | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nCountingInversions | :+1: |   | :+1: |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   | \nCycleSort | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nEditDistance | :+1: | :+1: |   |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   | \nKnuthMorrisPrath | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nPermutations | :+1: | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   | \nRabinKarp | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nTopologicalSort | :+1: | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nDiffieHellman |   | :+1: |   |   |   | :+1: |   |   |   |   | :+1: |   |   |   |   |   |   | \nknapsack |   |   | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nAStarSearch | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nBitapAlgorithm | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nCocktailSort | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nConjugateGradient | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nJohnsonAlgorithm | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nKnapsack | :+1: |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   | \nKruskalsAlgorithm | :+1: |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nLongestPath | :+1: | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nMinimax | :+1: |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   | \nBestFirstSearch |   |   | :+1: |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |   | \nConnectedComponentLabeling |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nLeakyBucket |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nPostmanSort |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   | \nBinaryTree | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nCoinChange | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nCombination | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nDungeonGame | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nEulerToient | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nFenwickTree | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nHeavyLightDecomposition | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nInFixToPostFix | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nInverseFastFourierTransform | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nJosephusProblem | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nLongestBitonicSubsequence | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nLongestSubsetZeroSum | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nMatrixExponentiation | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nModifiedBinarySearch | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nPersistentDataStructures | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nPrimalityTests | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nPrims | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nPruferCode | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nSegmentTree | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nSequenceAlignment | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nStringToToken | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nStronglyConnectedGraph | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nTarjansOfflineLCA | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nVEGASAlgorithm | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nCocktailshakersort |   |   |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   | \nDynamicProgramming |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nEdmondsKarp |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nElevatorAlgorithm |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nHistogramEqualization |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nMinMaxABPruning |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nPearsonHashing |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nRodCuttingAlgorithm |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nPartialSort |   |   |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   | \nAhoCorasick |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nBloomFilter |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nLuhn |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \nSumset |   | :+1: |   |   |   |   |   |   |   |   |   |   |   |   |   |   |   | \n\n\n[算法列表](Algorithms.md)\n\n文件目录结构应该有如下格式：[**Algorithm name**]/[**language**]/**file**\n\n*举例*\n* **BubbleSort/Go/BubbleSort.go**\n* **QuickSort/C++/QuickSort.cpp**\n\n## License\n\n[Apache License 2.0](LICENSE)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FThuva4%2FAlgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FThuva4%2FAlgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FThuva4%2FAlgorithms/lists"}