https://github.com/romantech/algorithm-study
알고리즘 / 자료구조 스터디
https://github.com/romantech/algorithm-study
algorithms data-structures programmers
Last synced: 9 months ago
JSON representation
알고리즘 / 자료구조 스터디
- Host: GitHub
- URL: https://github.com/romantech/algorithm-study
- Owner: romantech
- Created: 2021-05-29T16:30:16.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2024-05-22T10:24:56.000Z (over 1 year ago)
- Last Synced: 2024-05-22T19:11:35.558Z (over 1 year ago)
- Topics: algorithms, data-structures, programmers
- Language: JavaScript
- Homepage:
- Size: 457 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 알고리즘 스터디
- 사용 언어 : Javascript
## 프로그래머스
- 파일 이름 : 레벨 넘버\_문제 번호\_문제 제목
e.g. _level01_42576_greedy_
- 프로그래머스 접속 시 아래 링크에서 문제 번호만 바꿔서 접속 가능
e.g. __
## 정렬 알고리즘
- [버블 정렬](/src/sort-algorithm/bubbleSort.js)
- [선택 정렬](/src/sort-algorithm/selectionSort.js)
- [삽입 정렬](/src/sort-algorithm/insertionSort.js)
- [병합 정렬](/src/sort-algorithm/mergeSort.js)
- [퀵 정렬](/src/sort-algorithm/quickSort.js)
## 탐색 알고리즘
- [이진 탐색](/src/search-algorithm/binary-search.js)
- [좌측 이분 탐색 (bisect-left)](/src/search-algorithm/bisect-left.js)
- [우측 이분 탐색 (bisect-right)](/src/search-algorithm/bisect-right.js)
- [경계 요소 카운트 (bounds-counter)](/src/search-algorithm/bounds-counter.js)
- [다익스트라 (dijkstra)](/src/programmers/level-02/level02_12978_배달.js#L121)
- [백트래킹 (backtracking)](/src/programmers/level-02/level02_87946_피로도.js#L61)
## 자료 구조
- [우선순위 큐](/src/data-structure/priority-queue.js)
- [최소 힙](/src/data-structure/min-heap.js)
- [LRU 캐시](/src/data-structure/lru-cache.js)