{"id":21930724,"url":"https://github.com/rahulbisht001/daa_bootcamp","last_synced_at":"2026-04-28T21:04:49.998Z","repository":{"id":156286348,"uuid":"612593640","full_name":"RahulBisht001/DAA_Bootcamp","owner":"RahulBisht001","description":null,"archived":false,"fork":false,"pushed_at":"2023-06-30T16:38:14.000Z","size":912,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-27T12:21:16.857Z","etag":null,"topics":["algorithms","c","cpp","design-and-analysis-of-algorithms"],"latest_commit_sha":null,"homepage":"","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/RahulBisht001.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,"publiccode":null,"codemeta":null}},"created_at":"2023-03-11T12:15:14.000Z","updated_at":"2023-06-30T13:54:39.000Z","dependencies_parsed_at":"2023-07-10T11:47:01.642Z","dependency_job_id":null,"html_url":"https://github.com/RahulBisht001/DAA_Bootcamp","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/RahulBisht001%2FDAA_Bootcamp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RahulBisht001%2FDAA_Bootcamp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RahulBisht001%2FDAA_Bootcamp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RahulBisht001%2FDAA_Bootcamp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RahulBisht001","download_url":"https://codeload.github.com/RahulBisht001/DAA_Bootcamp/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244959444,"owners_count":20538626,"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","c","cpp","design-and-analysis-of-algorithms"],"created_at":"2024-11-28T23:11:14.098Z","updated_at":"2026-04-28T21:04:49.992Z","avatar_url":"https://github.com/RahulBisht001.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"##  DAA-Bootcamp\n\n* Binary Search Recurrence Relation : `T(n) = T(n/2) + 1` \nwhere `T(n)` is the time required for binary search in an array of size n.\n\n*  Recurrence Relation of Tower of Hanoi : `T(n) = 2* T(n -1) + 1`\n\n* Recurrence Relation of Quick Sort : `T(n) = T(n-1) + O(n)`\nbecause we need to sort the subArray of size `n-1` and partition the array of size `n` in\n`O(n)` time.\n\n* Recurrence Relation of Merge Sort : `T(n)=2T(n/2) + An`\n\n* Recurrence Relation of Fibonacci series : `T(n) = T(n−1) + T(n−2)`\n\n\n- [X] fibonacci series\n- [X] tower of hanoi\n- [ ] jump search\n- [ ] quick sort\n- [ ] merge sort\n- [ ] heap sort\n- [ ] 0/1 Knapsack problem \n- [ ] Longest common subsequence,\n- [ ] Matrix chain multiplication\n- [X] Hashing, HashFunction and Collisions\n- [ ] String Matching\n- [ ] The subset-sum problem\n- [ ] The traveling salesman problem","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frahulbisht001%2Fdaa_bootcamp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frahulbisht001%2Fdaa_bootcamp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frahulbisht001%2Fdaa_bootcamp/lists"}