{"id":15678591,"url":"https://github.com/gervinfung/commonsortingalgorithms","last_synced_at":"2025-08-24T12:42:02.620Z","repository":{"id":115226875,"uuid":"323016783","full_name":"GervinFung/CommonSortingAlgorithms","owner":"GervinFung","description":"9 most common sorting algorithms, Time and Space complexity provided","archived":false,"fork":false,"pushed_at":"2020-12-20T07:45:10.000Z","size":7,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-05T09:17:26.311Z","etag":null,"topics":["bubblesort","countingsort","exchangesort","heapsort","insertionsort","mergesort","quicksort","selection-sort","timsort"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GervinFung.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-12-20T07:23:23.000Z","updated_at":"2020-12-20T07:47:13.000Z","dependencies_parsed_at":"2023-05-25T22:31:48.143Z","dependency_job_id":null,"html_url":"https://github.com/GervinFung/CommonSortingAlgorithms","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/GervinFung%2FCommonSortingAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GervinFung%2FCommonSortingAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GervinFung%2FCommonSortingAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GervinFung%2FCommonSortingAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GervinFung","download_url":"https://codeload.github.com/GervinFung/CommonSortingAlgorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246285816,"owners_count":20752956,"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":["bubblesort","countingsort","exchangesort","heapsort","insertionsort","mergesort","quicksort","selection-sort","timsort"],"created_at":"2024-10-03T16:22:50.153Z","updated_at":"2025-03-30T07:13:35.520Z","avatar_url":"https://github.com/GervinFung.png","language":"Java","readme":"## Getting Started\n\nWelcome to the VS Code Java world. Here is a guideline to help you get started to write Java code in Visual Studio Code.\n\n## Folder Structure\n\nThe workspace contains two folders by default, where:\n\n- `src`: the folder to maintain sources\n- `lib`: the folder to maintain dependencies\n\n## Dependency Management\n\nThe `JAVA DEPENDENCIES` view allows you to manage your dependencies. More details can be found [here](https:||github.com|microsoft|vscode-java-pack|blob|master|release-notes|v0.9.0.md#work-with-jar-files-directly).\n\n## 9 most commonly use sorting methods (Time \u0026 Space Complexity provided)\n\nSorting Methods | Best    |   Average   |    Worst    | Space Complexity |\n| --- | --- | --- | --- | --- |\nTim Sort        | Ω(n)        | Θ(n log(n)) | O(n log(n)) | O(n)             |\nMergse Sort     | Ω(n log(n)) | Θ(n log(n)) | O(n log(n)) | O(n)             |\nHeap Sort       | Ω(n log(n)) | Θ(n log(n)) | O(n log(n)) | O(1)             |\nQuick Sort      | Ω(n log(n)) | Θ(n log(n)) | O(n^2)      | O(log(n))        |\nSelection Sort  | Ω(n^2)      | Θ(n^2)      | O(n^2)      | O(1)             |\nBubble Sort     | Ω(n)        | Θ(n^2)      | O(n^2)      | O(1)             |\nExchange Sort   | Ω(n)        | Θ(n^2)      | O(n^2)      | O(1)             |\nInsertion Sort  | Ω(n)        | Θ(n^2)      | O(n^2)      | O(1)             |\nCounting Sort   | Ω(n+k)      | Θ(n+k)      | O(n+k)      | O(k)             |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgervinfung%2Fcommonsortingalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgervinfung%2Fcommonsortingalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgervinfung%2Fcommonsortingalgorithms/lists"}