{"id":20744454,"url":"https://github.com/nickklos10/efficient_recursive_function","last_synced_at":"2026-04-18T21:32:28.100Z","repository":{"id":227515842,"uuid":"658167495","full_name":"nickklos10/efficient_recursive_function","owner":"nickklos10","description":null,"archived":false,"fork":false,"pushed_at":"2024-03-13T17:34:26.000Z","size":2,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-18T02:27:56.545Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C","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/nickklos10.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,"roadmap":null,"authors":null,"dei":null}},"created_at":"2023-06-25T01:38:53.000Z","updated_at":"2024-03-13T23:42:23.000Z","dependencies_parsed_at":"2024-03-13T18:46:31.724Z","dependency_job_id":"e7adb112-fd99-41bb-9abe-e5f247f4e1f6","html_url":"https://github.com/nickklos10/efficient_recursive_function","commit_stats":null,"previous_names":["nickklos10/lab_assignment_6","nickklos10/efficient_recursive_function"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nickklos10%2Fefficient_recursive_function","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nickklos10%2Fefficient_recursive_function/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nickklos10%2Fefficient_recursive_function/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nickklos10%2Fefficient_recursive_function/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nickklos10","download_url":"https://codeload.github.com/nickklos10/efficient_recursive_function/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243039584,"owners_count":20226131,"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":[],"created_at":"2024-11-17T07:15:38.753Z","updated_at":"2026-04-18T21:32:28.057Z","avatar_url":"https://github.com/nickklos10.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Efficient recursive function\n\nWrote an efficient recursive function that takes in a sorted array of numbers, two integers, low and high,\nrepresenting indexes into the array, and another integer, value, and returns the index in the array where\nvalue is found in the array in between index low and high, inclusive. If value is NOT found in the array in\nbetween indexes low and high, inclusive, then the function should return -1\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnickklos10%2Fefficient_recursive_function","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnickklos10%2Fefficient_recursive_function","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnickklos10%2Fefficient_recursive_function/lists"}