{"id":18985517,"url":"https://github.com/jagoda11/cs50-problem-set-3","last_synced_at":"2025-07-28T23:34:26.092Z","repository":{"id":222013248,"uuid":"138626877","full_name":"Jagoda11/CS50-Problem-Set-3","owner":"Jagoda11","description":"CS50-Problem-set-3 🚀 explores algorithms 🧠, focusing on more advanced concepts in computer science 💻. This set includes challenges 🧩 that require the implementation and understanding of sorting 🔢 and searching 🔍 algorithms, enhancing efficiency ⚡, and understanding algorithmic complexity 🤔","archived":false,"fork":false,"pushed_at":"2024-03-18T15:32:44.000Z","size":6,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-02-21T10:15:08.658Z","etag":null,"topics":["algorithms","computational","cs50","cs50problemsets","data-structures","problem-solving","searching","sorting"],"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/Jagoda11.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},"funding":{"github":"Jagoda11"}},"created_at":"2018-06-25T17:16:53.000Z","updated_at":"2024-05-22T15:06:19.000Z","dependencies_parsed_at":"2024-11-08T16:34:16.091Z","dependency_job_id":"79a25d59-fd32-429c-bb8f-fcf39d5447c8","html_url":"https://github.com/Jagoda11/CS50-Problem-Set-3","commit_stats":null,"previous_names":["jagoda11/pset3-for-cs50","jagoda11/cs50-problem-set-3"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Jagoda11/CS50-Problem-Set-3","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-3","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-3/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-3/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-3/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Jagoda11","download_url":"https://codeload.github.com/Jagoda11/CS50-Problem-Set-3/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jagoda11%2FCS50-Problem-Set-3/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267604324,"owners_count":24114522,"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-07-28T02:00:09.689Z","response_time":68,"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":["algorithms","computational","cs50","cs50problemsets","data-structures","problem-solving","searching","sorting"],"created_at":"2024-11-08T16:26:57.704Z","updated_at":"2025-07-28T23:34:26.070Z","avatar_url":"https://github.com/Jagoda11.png","language":"C","funding_links":["https://github.com/sponsors/Jagoda11"],"categories":[],"sub_categories":[],"readme":"# CS50 Problem Set 3 🚀\n\nWelcome to my CS50 Problem Set 3 repository! This set dives into more advanced data manipulation using arrays and introduces essential search algorithms. Let's explore the fascinating world of arrays and searching! 🧐\n\n## Array 📊\n\n- **Filename:** `array.c`\n- **Description:** This program demonstrates various array manipulations in C. It allows the user to input a series of numbers, then performs a variety of operations to showcase the power of arrays. These operations include finding the maximum, minimum, average, and the gap between the maximum and minimum values. Additionally, it explores more advanced concepts like finding the second maximum, reversing the array, filtering even numbers, and creatively merging array halves.\n\n## Search 🔍\n\n- **Filename:** `search.c`\n- **Description:** This program performs a case-insensitive search of a keyword within a given text. The user is prompted to enter a text and a keyword, and the program reports the position of the keyword within the text if found. This illustrates a practical application of string searching algorithms in C.\n\n## Getting Started 🏁\n\nTo interact with these programs, clone the repository and compile each file using `clang` or `make`. Execute the compiled program in the terminal, follow the prompts, and witness the array manipulations and search algorithms in action!\n\n## Dive into CS50 🤿\n\nProblem Set 3 is a significant leap forward, deepening your understanding of data structures and algorithms—a crucial step in your journey through the world of computer science.\n\nFeel free to explore!\n\nHappy Coding! 💻🎉","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjagoda11%2Fcs50-problem-set-3","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjagoda11%2Fcs50-problem-set-3","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjagoda11%2Fcs50-problem-set-3/lists"}