{"id":15698405,"url":"https://github.com/ultirequiem/algos","last_synced_at":"2025-05-09T01:15:01.931Z","repository":{"id":48969519,"uuid":"437666287","full_name":"UltiRequiem/algos","owner":"UltiRequiem","description":"💼 Each Friday a new Algorithm (Code + Explanation)","archived":false,"fork":false,"pushed_at":"2023-01-06T21:46:00.000Z","size":6,"stargazers_count":6,"open_issues_count":0,"forks_count":3,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-05-09T01:14:55.081Z","etag":null,"topics":["algorithms","data-structures","typescript"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","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/UltiRequiem.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":"2021-12-12T22:02:35.000Z","updated_at":"2023-02-04T11:25:31.000Z","dependencies_parsed_at":"2023-02-06T09:31:22.014Z","dependency_job_id":null,"html_url":"https://github.com/UltiRequiem/algos","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/UltiRequiem%2Falgos","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/UltiRequiem%2Falgos/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/UltiRequiem%2Falgos/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/UltiRequiem%2Falgos/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/UltiRequiem","download_url":"https://codeload.github.com/UltiRequiem/algos/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253171272,"owners_count":21865297,"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","data-structures","typescript"],"created_at":"2024-10-03T19:27:01.177Z","updated_at":"2025-05-09T01:15:01.893Z","avatar_url":"https://github.com/UltiRequiem.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms\n\n## sorting\n\nlinear search \u003c jump search \u003c binary search\n\n## extra\n\nAlgorithm is a step-by-step procedure, which defines a set of instructions to be\nexecuted in a certain order to get the desired output.\n\nAlgorithms are generally created independent of underlying languages, i.e. an\nalgorithm can be implemented in more than one programming language.\n\nFrom the data structure point of view, following are some important categories\nof algorithms:\n\n- Search − Algorithm to search an item in a data structure.\n\n- Sort − Algorithm to sort items in a certain order.\n\n- Insert − Algorithm to insert item in a data structure.\n\n- Update − Algorithm to update an existing item in a data structure.\n\n- Delete − Algorithm to delete an existing item from a data structure.\n\n### Characteristics of an Algorithm\n\nNot all procedures can be called an algorithm. An algorithm should have the\nfollowing characteristics:\n\n- Unambiguous: Algorithm should be clear and unambiguous. Each of its steps (or\n  phases), and their inputs/outputs should be clear and must lead to only one\n  meaning.\n\n- Input: An algorithm should have 0 or more well-defined inputs.\n\n- Output: An algorithm should have 1 or more well-defined outputs, and should\n  match the desired output.\n\n- Finiteness: Algorithms must terminate after a finite number of steps.\n\n- Feasibility: Should be feasible with the available resources.\n\n- Independent: An algorithm should have step-by-step directions, which should be\n  independent of any programming code.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fultirequiem%2Falgos","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fultirequiem%2Falgos","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fultirequiem%2Falgos/lists"}