{"name":"HEAP_SORT","downloads":450,"version":"0.1.0","version_created_at":"2024-10-23T16:41:04.901Z","version_downloads":450,"platform":"ruby","authors":"fade","info":"A Ruby implementation of the heap sort algorithm, which sorts an array by\nbuilding a max heap and then repeatedly extracting the maximum element.","licenses":[],"metadata":{"homepage_uri":"https://github.com/sgn-fade/HEAP_SORT","changelog_uri":"https://github.com/sgn-fade/HEAP_SORT","source_code_uri":"https://github.com/sgn-fade/HEAP_SORT","allowed_push_host":"https://rubygems.org"},"yanked":false,"sha":"2623b2c8bb24e16ce2769f5f87cd0a699a89111bffcdf0e0f39b7f95c6c05c83","spec_sha":"8a55dec44811cbb0b5d461466c8c88fdfffe8c73b087514848e2b4954f1c2df5","project_uri":"https://rubygems.org/gems/HEAP_SORT","gem_uri":"https://rubygems.org/gems/HEAP_SORT-0.1.0.gem","homepage_uri":"https://github.com/sgn-fade/HEAP_SORT","wiki_uri":null,"documentation_uri":null,"mailing_list_uri":null,"source_code_uri":"https://github.com/sgn-fade/HEAP_SORT","bug_tracker_uri":null,"changelog_uri":"https://github.com/sgn-fade/HEAP_SORT","funding_uri":null,"dependencies":{"development":[],"runtime":[]}}