{"id":20392764,"url":"https://github.com/g3th/binary_heap_type","last_synced_at":"2025-12-01T20:09:48.371Z","repository":{"id":200620409,"uuid":"705926206","full_name":"g3th/Binary_Heap_Type","owner":"g3th","description":"Determine whether a Binary Heap structure is 'min', 'max' or 'no-heap'.","archived":false,"fork":false,"pushed_at":"2023-10-17T01:29:33.000Z","size":41,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-15T10:27:10.038Z","etag":null,"topics":["algorithms","binary-heap","data-structures","kotlin","max-heap","min-heap"],"latest_commit_sha":null,"homepage":"","language":"Kotlin","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/g3th.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}},"created_at":"2023-10-17T01:09:40.000Z","updated_at":"2023-10-17T01:30:45.000Z","dependencies_parsed_at":null,"dependency_job_id":"3d40587a-934d-4343-aac4-6ee4a2f75f9b","html_url":"https://github.com/g3th/Binary_Heap_Type","commit_stats":null,"previous_names":["g3th/binary_heap_type"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FBinary_Heap_Type","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FBinary_Heap_Type/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FBinary_Heap_Type/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/g3th%2FBinary_Heap_Type/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/g3th","download_url":"https://codeload.github.com/g3th/Binary_Heap_Type/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241942034,"owners_count":20046227,"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","binary-heap","data-structures","kotlin","max-heap","min-heap"],"created_at":"2024-11-15T03:45:29.539Z","updated_at":"2025-12-01T20:09:43.329Z","avatar_url":"https://github.com/g3th.png","language":"Kotlin","readme":"A binary heap is a type of data structure which can be easily represented in a program in array form, as demonstrated below:\n\n\u003cimg src='assets/1.png' width=60%\u003e\n\n``` [16, 11, 9, 10, 7, 3, 4, 6, 5] ```\n\n In order to compare these elements and determine which heap-type the array is, types being 'max-heap', 'min-heap' or 'no-heap, an algorithm can be written using the formula:\n\n```Element[index] [comparison operator] Element[2 * i + 1] || Element[2 * i + 2]```\n\nchecking if ```index * 2 + 1``` is out of bounds with appropriate conditions.\n\nThis program will read from a text file which has arrays representing Binary structures, parses them, and determines which type of structure it belongs to. An example text file is already included.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fg3th%2Fbinary_heap_type","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fg3th%2Fbinary_heap_type","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fg3th%2Fbinary_heap_type/lists"}