{"id":26823928,"url":"https://github.com/romantech/algorithm-study","last_synced_at":"2025-03-30T09:17:11.473Z","repository":{"id":238130400,"uuid":"372021017","full_name":"romantech/algorithm-study","owner":"romantech","description":"알고리즘 / 자료구조 스터디","archived":false,"fork":false,"pushed_at":"2024-05-22T10:24:56.000Z","size":468,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-05-22T19:11:35.558Z","etag":null,"topics":["algorithms","data-structures","programmers"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/romantech.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":"2021-05-29T16:30:16.000Z","updated_at":"2024-05-28T07:03:16.806Z","dependencies_parsed_at":"2024-05-28T07:02:56.536Z","dependency_job_id":"c753ca8a-6ce8-4cbe-8498-90794148d8b0","html_url":"https://github.com/romantech/algorithm-study","commit_stats":null,"previous_names":["romantech/algorithm-study"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romantech%2Falgorithm-study","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romantech%2Falgorithm-study/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romantech%2Falgorithm-study/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/romantech%2Falgorithm-study/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/romantech","download_url":"https://codeload.github.com/romantech/algorithm-study/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246296578,"owners_count":20754635,"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","data-structures","programmers"],"created_at":"2025-03-30T09:17:11.077Z","updated_at":"2025-03-30T09:17:11.463Z","avatar_url":"https://github.com/romantech.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 알고리즘 스터디\n\n- 사용 언어 : Javascript\n\n## 프로그래머스\n\n- 파일 이름 : 레벨 넘버\\_문제 번호\\_문제 제목\n  e.g. _level01_42576_greedy_\n- 프로그래머스 접속 시 아래 링크에서 문제 번호만 바꿔서 접속 가능\n  e.g. _\u003chttps://programmers.co.kr/learn/courses/30/lessons/문제번호\u003e_\n\n## 정렬 알고리즘\n\n- [버블 정렬](/src/sort-algorithm/bubbleSort.js)\n- [선택 정렬](/src/sort-algorithm/selectionSort.js)\n- [삽입 정렬](/src/sort-algorithm/insertionSort.js)\n- [병합 정렬](/src/sort-algorithm/mergeSort.js)\n- [퀵 정렬](/src/sort-algorithm/quickSort.js)\n\n## 탐색 알고리즘\n\n- [이진 탐색](/src/search-algorithm/binary-search.js)\n- [좌측 이분 탐색 (bisect-left)](/src/search-algorithm/bisect-left.js)\n- [우측 이분 탐색 (bisect-right)](/src/search-algorithm/bisect-right.js)\n- [경계 요소 카운트 (bounds-counter)](/src/search-algorithm/bounds-counter.js)\n- [다익스트라 (dijkstra)](/src/programmers/level-02/level02_12978_배달.js#L121)\n- [백트래킹 (backtracking)](/src/programmers/level-02/level02_87946_피로도.js#L61)\n\n## 자료 구조\n\n- [우선순위 큐](/src/data-structure/priority-queue.js)\n- [최소 힙](/src/data-structure/min-heap.js)\n- [LRU 캐시](/src/data-structure/lru-cache.js)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fromantech%2Falgorithm-study","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fromantech%2Falgorithm-study","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fromantech%2Falgorithm-study/lists"}