{"id":23343937,"url":"https://github.com/rorysroes/fast_algorithm_fft","last_synced_at":"2025-04-10T02:21:56.020Z","repository":{"id":30548262,"uuid":"34102991","full_name":"rorysroes/Fast_Algorithm_FFT","owner":"rorysroes","description":"Implement Cooley–Tukey FFT algorithm with C","archived":false,"fork":false,"pushed_at":"2017-02-18T09:28:56.000Z","size":25,"stargazers_count":7,"open_issues_count":1,"forks_count":3,"subscribers_count":2,"default_branch":"quick-median","last_synced_at":"2025-03-24T03:53:07.921Z","etag":null,"topics":["bit-reversal","butterfly-structures","discrete-fourier-transform","fast-fourier-transform","fft","quicksort-algorithm"],"latest_commit_sha":null,"homepage":"","language":"C++","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/rorysroes.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}},"created_at":"2015-04-17T07:33:43.000Z","updated_at":"2025-01-08T23:50:57.000Z","dependencies_parsed_at":"2022-09-22T13:02:18.811Z","dependency_job_id":null,"html_url":"https://github.com/rorysroes/Fast_Algorithm_FFT","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/rorysroes%2FFast_Algorithm_FFT","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rorysroes%2FFast_Algorithm_FFT/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rorysroes%2FFast_Algorithm_FFT/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rorysroes%2FFast_Algorithm_FFT/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rorysroes","download_url":"https://codeload.github.com/rorysroes/Fast_Algorithm_FFT/tar.gz/refs/heads/quick-median","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248143155,"owners_count":21054718,"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":["bit-reversal","butterfly-structures","discrete-fourier-transform","fast-fourier-transform","fft","quicksort-algorithm"],"created_at":"2024-12-21T06:17:21.229Z","updated_at":"2025-04-10T02:21:55.978Z","avatar_url":"https://github.com/rorysroes.png","language":"C++","readme":"\n## Use quicksort algorithm to find median \n[Quick Median Code] (https://github.com/rorysroes/Fast_Algorithm_FFT/blob/quick-median/median.cpp)：\nThis project I implemented quicksort algorithm to find median value in the sequence.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frorysroes%2Ffast_algorithm_fft","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frorysroes%2Ffast_algorithm_fft","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frorysroes%2Ffast_algorithm_fft/lists"}