{"id":22743961,"url":"https://github.com/j-hoplin/algorithm_class","last_synced_at":"2025-03-30T04:43:01.641Z","repository":{"id":126434254,"uuid":"480781702","full_name":"J-Hoplin/Algorithm_Class","owner":"J-Hoplin","description":"3rd Grade 1st Semester : Algorithm / Description : Implement Algorithms that learned in class via Python, C++ ","archived":false,"fork":false,"pushed_at":"2022-06-18T16:46:03.000Z","size":7664,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-05T15:48:21.680Z","etag":null,"topics":["algorithm"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","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/J-Hoplin.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}},"created_at":"2022-04-12T11:31:34.000Z","updated_at":"2022-06-05T07:54:04.000Z","dependencies_parsed_at":"2023-06-16T17:30:36.662Z","dependency_job_id":null,"html_url":"https://github.com/J-Hoplin/Algorithm_Class","commit_stats":null,"previous_names":["j-hoplin/algorithm_class"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/J-Hoplin%2FAlgorithm_Class","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/J-Hoplin%2FAlgorithm_Class/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/J-Hoplin%2FAlgorithm_Class/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/J-Hoplin%2FAlgorithm_Class/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/J-Hoplin","download_url":"https://codeload.github.com/J-Hoplin/Algorithm_Class/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246277350,"owners_count":20751548,"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":["algorithm"],"created_at":"2024-12-11T01:37:14.841Z","updated_at":"2025-03-30T04:43:01.622Z","avatar_url":"https://github.com/J-Hoplin.png","language":"Jupyter Notebook","readme":"# Algorithm : 3rd Grad / 1st Semester\n### Looking for Contributor\n자신만의 소스코드를 공유하거나, 더 나은 소스코드를 위해 같이 개선해 나아갈 분들은 언제든지 환영입니다!\n***\nSubject\n  - 알고리즘 및 실습 / 3학년 1학기 전공필수 / prof. 신지애\n\n\nContributers\n  - [Hoplin (윤준호)](https://github.com/J-hoplin1) : Implement with Python3\n  - [was564 (김홍준)](https://github.com/was564) : Implement with C++\n***\n### Programming Assignments\n  - [Assignment 1 : Iterative QuickSort / Recursive QuickSort / Randomized QuickSort](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Programming%20Assignment/Assignment%201)\n    - Window 환경에서 실행이 잘 되지 않는 경우도 있습니다. 이런 경우에는 [benchmark.py에서 10^6](https://github.com/J-hoplin1/Algorithm_Class/blob/65f9d5d10197fde87e6fa57395322d9084770404/Programming%20Assignment/Assignment%201/%EC%9C%A4%EC%A4%80%ED%98%B8_ProgrammingAssignment1/benchmark.py#L19) 을 리스트에서 지운 후 실행해 주시면 됩니다.(개인 PC성능차이에 따라 결과가 달라질 수 있습니다.) \n\n  - [Assignment 2 : Priority Queue / Prim MST Algorithm](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Programming%20Assignment/Assignment%202)\n    - 'pip3 install -r requirements.txt' 를 통해 requirements를 미리 설치하시는것을 권장드립니다.\n***\n### Sorting\n\n  - [Bubble Sort(버블정렬)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Sorting/bubble_sort)\n  - [Heap Sort(힙정렬)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Sorting/heap_sort)\n  - [Insertion Sort(삽입정렬)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Sorting/insertion_sort)\n  - [Merge Sort(병합정렬)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Sorting/merge_sort)\n  - [Quick Sort(퀵정렬)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Sorting/quick_sort)\n  - [Selection Sort(선택정렬)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Sorting/selection_sort)\n  - [Counting Sort(계수정렬)](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Sorting/counting_sort)\n    - 연관된 문제\n      - [백준 10989 - 수 정렬하기3](https://www.acmicpc.net/problem/10989) : [Solution](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Related%20PS%20Problem/Sorting%20Algorithm/BOJ_10989.py)\n\n### Priority Queue\n\n  - [Heap](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Priority%20Queue/Heap)\n  - [Priority Queue using Heap](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Priority%20Queue/PriQueue)\n    - 위에서 구현한 Heap을 사용하여 구동됩니다. Priority Queue를 보시기 전에 Heap을 모르신다면, [Heap](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Priority%20Queue/Heap)을 공부하고 보시는걸 추천드립니다.\n\n### Search Tree\n\n  - [Binary Search Tree(이진 검색트리)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Search%20Tree/BST(Binary%20Search%20Tree))\n\n### Hash\n\n  - [Chained Hash](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Hashing/Python/ChainedHash.py)\n  - [OpenAddress Hash](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Hashing/Python/OpenAddressHash.py)\n\n### Set(집합)\n\n  - [Union Find Algorithm](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Set/UnionFind/unionfind.py)\n\n### Dynamic Programming(동적계획법)\n\n  - [Fibonacci Number](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Dynamic%20Programming/Fibonacci.py)\n    - 연관된 문제\n      - [백준 24416 - 알고리즘수업 피보나치1](https://www.acmicpc.net/problem/24416) : [Solution](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Related%20PS%20Problem/Dynamic%20Programming/BOJ_24416.py)\n  - [LCS](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Dynamic%20Programming/LCS.py)\n    - 연관된 문제\n      - [백준 9251 - LCS](https://www.acmicpc.net/problem/9251) : [Solution](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Related%20PS%20Problem/Dynamic%20Programming/BOJ_9251.py)\n\n### Graph Algorithm\n  \n  #### Graph 기본\n\n  **Readme를 확인해주세요 : [Readme.md](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Graph%20Algorithm/Readme.md)**\n  - [BFS](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Graph%20Algorithm/BFS)\n  - [DFS](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Graph%20Algorithm/DFS)\n    - 연관된 문제\n      - [백준 1260 - DFS/BFS](https://www.acmicpc.net/problem/1260) : [Solution](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Related%20PS%20Problem/Graph%20Algorithm/BOJ_1260.py)\n      - [백준 2606 - 바이러스](https://www.acmicpc.net/problem/2606) : [Solution](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Related%20PS%20Problem/Graph%20Algorithm/BOJ_2606.py)\n\n  #### Minimum Spanning Tree(최소신장트리)\n\n  - [Prim's Algorithm](https://github.com/J-hoplin1/Algorithm_Class/blob/main/Graph%20Algorithm/MST(Mininum%20Spanning%20Tree)/PrimAlgorithm.py)\n    \n  #### Topological Sort(위상정렬)\n\n  - [Topological Sort](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Graph%20Algorithm/TopologicalSort)\n\n  #### Shortest Path(최단경로)\n\n  - [Dijkstra Algorithm(다익스트라)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Graph%20Algorithm/ShortestPath/Dijkstra%20Algorithm)\n  - [Floyd Warshall(플로이드 워셜)](https://github.com/J-hoplin1/Algorithm_Class/tree/main/Graph%20Algorithm/ShortestPath/FloydWarshall%20Algorithm)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fj-hoplin%2Falgorithm_class","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fj-hoplin%2Falgorithm_class","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fj-hoplin%2Falgorithm_class/lists"}