{"id":18702216,"url":"https://github.com/gagoar/binarythings","last_synced_at":"2025-11-09T01:30:27.192Z","repository":{"id":137207859,"uuid":"102522576","full_name":"gagoar/binaryThings","owner":"gagoar","description":"some algorithmic implementations of common questions about binary search, and such.   ","archived":false,"fork":false,"pushed_at":"2021-10-13T02:27:37.000Z","size":373,"stargazers_count":1,"open_issues_count":1,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2024-12-28T05:42:58.171Z","etag":null,"topics":["algorithms-implemented","javascript"],"latest_commit_sha":null,"homepage":null,"language":"JavaScript","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/gagoar.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-09-05T19:39:10.000Z","updated_at":"2023-03-04T06:09:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"1bd3db24-9359-4a21-a913-da038f716421","html_url":"https://github.com/gagoar/binaryThings","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/gagoar%2FbinaryThings","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gagoar%2FbinaryThings/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gagoar%2FbinaryThings/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gagoar%2FbinaryThings/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gagoar","download_url":"https://codeload.github.com/gagoar/binaryThings/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239565644,"owners_count":19660154,"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-implemented","javascript"],"created_at":"2024-11-07T11:45:15.879Z","updated_at":"2025-11-09T01:30:27.150Z","avatar_url":"https://github.com/gagoar.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Binary Things\nsome algorithmic implementations of common questions about binary search, balanced trees and such.\n\n# Why?\n\nI got my degree on CS around 7 years ago. even tho my work has been about designing experiences around Frontend, Backend, API's even databases some problems like a binary search or how to balance a binary tree were things I never got asked or even had to solve again. Every tooling or framework would do this for me. or even easier, I would read the implementation and re implement them in whatever the environment/language I was using at the time.\n\n# So why do we need this again?\n\nWe _might_ need it to solve some interview questions, perhaps it would come handy if we need to fix something that is not working properly (and the c\u0026p doesn't _cut_ it anymore) or even just to refresh and learn some engrained algorithmic trickery in every _grep_ _find_ or even _search_ command/button we have used or cliked on!\n\n# How?\n\nUsing JS when possible and English to the best of my ability.\nProbably with MD files along with the code and some tests showing that the code works.\n\n\n# list of algorithms\n\n - Binary Seach\n - Balancing a Binary Search Tree\n - Dynamic programming\n - BFS\n - Big O notation:\n  - It tells you how fast a function grows or declines.\n  - The letter O (not 0) is used because the rate of growth of a function is also called its order.\n  - more explained: http://web.mit.edu/16.070/www/lecture/big_o.pdf\n - depth-first\n - breadth-first.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgagoar%2Fbinarythings","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgagoar%2Fbinarythings","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgagoar%2Fbinarythings/lists"}