{"id":22153193,"url":"https://github.com/dpetrosy/saed_algorithms","last_synced_at":"2025-09-10T15:36:31.985Z","repository":{"id":213260030,"uuid":"470041696","full_name":"dpetrosy/SAED_algorithms","owner":"dpetrosy","description":"In this repository, I store implementations of algorithms learned at the university.","archived":false,"fork":false,"pushed_at":"2024-02-05T14:24:55.000Z","size":50,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-29T18:46:40.300Z","etag":null,"topics":["algorithms","cpp","cpp11","heap","modern-cpp","problem-solving","sorting-algorithms","university-course"],"latest_commit_sha":null,"homepage":"","language":"C++","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/dpetrosy.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":"2022-03-15T07:00:34.000Z","updated_at":"2024-02-05T14:30:47.000Z","dependencies_parsed_at":"2024-01-11T18:26:38.565Z","dependency_job_id":"a3fec45a-e487-453f-a9d6-c145284b29e8","html_url":"https://github.com/dpetrosy/SAED_algorithms","commit_stats":null,"previous_names":["dpetrosy/algorithms","dpetrosy/saed_algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dpetrosy","download_url":"https://codeload.github.com/dpetrosy/SAED_algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245283860,"owners_count":20590299,"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","cpp","cpp11","heap","modern-cpp","problem-solving","sorting-algorithms","university-course"],"created_at":"2024-12-02T01:17:28.525Z","updated_at":"2025-03-24T13:42:28.108Z","avatar_url":"https://github.com/dpetrosy.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 📜 About Repository\n**SAED** stands for Synopsys Armenia Educational Department, the university where I received my bachelor's degree. \\\nIn this repository, I store my implemented algorithms, which I learned during SAED's algorithms course.\n\n## 📑 Subjects\n\n1. Write a program that calculates the square root of a number using the Babylon method.\n2. Write a program to check if an integer is prime.\n3. Write a program to find the greatest common divisor (GCD) of two integers by prime factorization.\n4. Write a program to find the greatest common divisor (GCD) of two integers using the Euclidean algorithm.\n5. Write a program that will calculate the lowest common multiple (LCM) of two integers by factorization.\n6. Implement the \"Insertion Sort\" algorithm, which will sort n integers in increasing order.\n7. Write a program that adds two n-bit binary numbers, stored in two arrays of size n.\n8. Write a program that finds the maximum element in an array of size n. Analyze the running time.\n9. Implement the \"Selection Sort\" algorithm, which will sort n integers in increasing order.\n10. Implement the \"Merge Sort\" algorithm, which will sort n integers in increasing order.\n11. Implement a recursive version of \"Insertion Sort\".\n12. Implement a recursive version of \"Binary Search\".\n13. Implement a loop version of \"Binary Search\".\n14. Implement a hybrid sorting algorithm of Merge and Insertion sort so that in cases where the array size gets smaller than the given k positive number, it directly sorts with Insertion.\n15. Implement the \"Bubble Sort\" algorithm, which will sort n integers in increasing order.\n16. Swap two integers without a temporary.\n17. Given an array of integers, write a program to output its maximum subarray indices. Implement the brute-force version with O(n^2) complexity.\n18. Solve problem 17 with the O(n) complexity algorithm.\n19. Implement the \"Min Heapify\" algorithm.\n20. Implement an iterative version of the \"Max Heapify\" algorithm.\n21. Implement a bogomax() function that takes an array and returns the first element if it's the maximum; otherwise, it finds the maximum by repeatedly swapping the first element with a randomly selected one and re-checking.\n22. Write a function that will find the middle node value in a singly linked list.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdpetrosy%2Fsaed_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdpetrosy%2Fsaed_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdpetrosy%2Fsaed_algorithms/lists"}