{"id":21076373,"url":"https://github.com/rapter1990/quick-sort-example","last_synced_at":"2025-10-30T03:11:52.746Z","repository":{"id":124091107,"uuid":"298365582","full_name":"Rapter1990/Quick-Sort-Example","owner":"Rapter1990","description":"Quick Sort Example","archived":false,"fork":false,"pushed_at":"2020-11-23T07:48:15.000Z","size":17,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-20T22:53:05.186Z","etag":null,"topics":["java","quicksort"],"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/Rapter1990.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-09-24T18:39:35.000Z","updated_at":"2021-03-10T08:22:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"58b15e43-607c-45ae-b1a1-224ee015812c","html_url":"https://github.com/Rapter1990/Quick-Sort-Example","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/Rapter1990%2FQuick-Sort-Example","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rapter1990%2FQuick-Sort-Example/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rapter1990%2FQuick-Sort-Example/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Rapter1990%2FQuick-Sort-Example/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Rapter1990","download_url":"https://codeload.github.com/Rapter1990/Quick-Sort-Example/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243521251,"owners_count":20304185,"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":["java","quicksort"],"created_at":"2024-11-19T19:28:04.610Z","updated_at":"2025-10-30T03:11:47.727Z","avatar_url":"https://github.com/Rapter1990.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1\u003eQuick Sort Example\u003c/h1\u003e\n\n\u003cul\u003e\n  \u003cli\u003eQuickSort is a Divide and Conquer algorithm like Merge Sort. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways such as always pick first element as pivot, always pick last element as pivot, pick a random element as pivot, pick median as pivot\u003c/li\u003e\n  \u003cli\u003eThis java example shows how to sort an element of Java ArrayList using Quick Sort method of Collections class.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch3\u003eThe objective of Program\u003c/h3\u003e\n\u003cul\u003e\n  \u003cli\u003eThe program firstly assign some values including person's atttributes to its object and performs sort process in terms of each attribute title. All sort process is implemented by Turkish alphabetical order.\u003c/li\u003e\n\u003c/ul\u003e\n\n\n\u003ch3\u003eFiles contaning in this repository\u003c/h3\u003e\n\u003cul\u003e\n  \u003cli\u003esrc\n    \u003cul\u003e\n      \u003cli\u003equicksort\n        \u003cul\u003e\n          \u003cli\u003eQuickSortProcess.java\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003emain\n        \u003cul\u003e\n          \u003cli\u003eMain.java\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003emodel\n        \u003cul\u003e\n          \u003cli\u003ePerson.java\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n      \u003cli\u003eutil\n        \u003cul\u003e\n          \u003cli\u003eDefineValues.java\u003c/li\u003e\n          \u003cli\u003eShowProcess.java\u003c/li\u003e\n        \u003c/ul\u003e\n      \u003c/li\u003e\n    \u003c/ul\u003e\n  \u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch3\u003eExplaining an inforamtion of each file\u003c/h3\u003e\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003cth\u003eFiles Names\u003c/th\u003e\n    \u003cth\u003eInformation\u003c/th\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eQuickSortProcess.java\u003c/td\u003e\n    \u003ctd\u003eImplementing QuickSort Sort Process by Turkish alphabetical order\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003ePerson.java\u003c/td\u003e\n    \u003ctd\u003eDefining it as a POJO\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eMain.java\u003c/td\u003e\n    \u003ctd\u003eHandle with all project files to run the program\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eShowProcess.java\u003c/td\u003e\n    \u003ctd\u003eShowing all information about Person Object as output \u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003eDefineValues.java\u003c/td\u003e\n    \u003ctd\u003eFilling its attributes into Person Object\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frapter1990%2Fquick-sort-example","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frapter1990%2Fquick-sort-example","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frapter1990%2Fquick-sort-example/lists"}