{"id":20248579,"url":"https://github.com/ndsvw/median-maintenance","last_synced_at":"2025-08-02T03:35:11.159Z","repository":{"id":44173766,"uuid":"217590129","full_name":"ndsvw/Median-Maintenance","owner":"ndsvw","description":"Median-Maintenance keeps track of the median of a growing list of numbers. O(log(n)) complexity for each of the n list elements =\u003e O(n*log(n))","archived":false,"fork":false,"pushed_at":"2022-02-11T07:11:42.000Z","size":15,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-03-03T16:12:45.942Z","etag":null,"topics":["algorithm","complexity","logarithmic","median"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ndsvw.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2019-10-25T18:10:31.000Z","updated_at":"2022-02-11T07:11:37.000Z","dependencies_parsed_at":"2022-08-26T08:50:46.918Z","dependency_job_id":null,"html_url":"https://github.com/ndsvw/Median-Maintenance","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ndsvw/Median-Maintenance","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMedian-Maintenance","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMedian-Maintenance/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMedian-Maintenance/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMedian-Maintenance/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ndsvw","download_url":"https://codeload.github.com/ndsvw/Median-Maintenance/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ndsvw%2FMedian-Maintenance/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":268331047,"owners_count":24233165,"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","status":"online","status_checked_at":"2025-08-02T02:00:12.353Z","response_time":74,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["algorithm","complexity","logarithmic","median"],"created_at":"2024-11-14T09:48:41.634Z","updated_at":"2025-08-02T03:35:11.116Z","avatar_url":"https://github.com/ndsvw.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Median-Maintenance\n\nMedian-Maintenance keeps track of the median of a growing list of numbers.\n\n### Complexity\n\n* add(int x) =\u003e O(log(n)), n is the number of elements so far\n* getMedian() =\u003e O(1)\n* adding n elements to this data structure and return the median after each add-Operation: O(n*log(n))\n\n### Examples\n\n```java\nMedianMaintenance\u003cInteger\u003e mm = new MedianMaintenance\u003cInteger\u003e(3);\nmm.add(4);\nmm.getMedian(); // returns 4\nmm.add(10);\nmm.getMedian(); // returns 4\nmm.add(20);\nmm.getMedian(); // returns 10\n```\n\n```java\nMedianMaintenance\u003cInteger\u003e mm = new MedianMaintenance\u003cInteger\u003e(6);\nmm.add(0);\nmm.getMedian(); // returns 0\nmm.add(1);\nmm.getMedian(); // returns 0\nmm.add(2);\nmm.getMedian(); // returns 1\nmm.add(3);\nmm.getMedian(); // returns 1\nmm.add(4);\nmm.getMedian(); // returns 2\nmm.add(5);\nmm.getMedian(); // returns 2\n```\n\n```java\nMedianMaintenance\u003cInteger\u003e mm = new MedianMaintenance\u003cInteger\u003e(6);\nmm.addAndReturnMedian(4); // returns 4\nmm.addAndReturnMedian(7); // returns 4\nmm.addAndReturnMedian(1); // returns 4\nmm.addAndReturnMedian(3); // returns 3\nmm.addAndReturnMedian(10); // returns 4\nmm.addAndReturnMedian(12); // returns 4\n```\n\n```java\nMedianMaintenance\u003cDouble\u003e mm = new MedianMaintenance\u003cDouble\u003e();\nmm.addAndReturnMedian(-1.1); // returns -1.1\nmm.addAndReturnMedian(9.1); // returns -1.1\nmm.addAndReturnMedian(-2.7); // returns -1.1\nmm.addAndReturnMedian(-8.1); // returns -2.7\nmm.addAndReturnMedian(-7); // returns -2.7\nmm.addAndReturnMedian(6.6); // returns -2.7\nmm.addAndReturnMedian(6.8); // returns -1.1\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fndsvw%2Fmedian-maintenance","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fndsvw%2Fmedian-maintenance","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fndsvw%2Fmedian-maintenance/lists"}