https://github.com/365kim/algorithm_study
@dev-jko 와 함께하는 42알고리즘 스터디
https://github.com/365kim/algorithm_study
algorithm data-structures
Last synced: 3 months ago
JSON representation
@dev-jko 와 함께하는 42알고리즘 스터디
- Host: GitHub
- URL: https://github.com/365kim/algorithm_study
- Owner: 365kim
- Created: 2020-03-02T11:33:23.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2022-08-27T04:47:12.000Z (about 3 years ago)
- Last Synced: 2025-04-14T10:09:08.859Z (7 months ago)
- Topics: algorithm, data-structures
- Language: C
- Homepage: https://github.com/nadarm/42-algorithm
- Size: 383 KB
- Stars: 12
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Data Sturcture & Algorithm
### :runner: Study Mento : [**nadarm**](https://github.com/nadarm/42-algorithm) (aka jko)
### :memo: Definition
- `자료구조` : 데이터를 효율적으로 이용할 수 있도록 컴퓨터에 저장하는 방법
- 데이터의 특성에 따라 분류하여 구성하고 저장 및 처리하는 모든 작업을 의미
- 데이터 처리의 성능과 효율에 직접적으로 영향을 끼치기 때문에 실제 데이터들의 관계를 잘 반영해야 함
- `알고리즘` : 자료구조로 표현된 데이터들을 처리하는 절차
- `Big-O 표기법` : 입력의 크기에 따라 근사적으로 성능을 표기하는 방법
- 알고리즘의 시간복잡도와 공간복잡도를 나타내는데 사용
- 성능은 항상 최선, 평균, 최악 중 보장의 의미가 있는 최악의 경우로 얘기해야 함
- 시간복잡도 _(cpu)_ 가 공간복잡도 _(memory)_ 보다 중요
---
### :memo: Contents
- Curriculum designed by [**nadarm**](https://github.com/nadarm/42-algorithm)
| Collection of
Problems | __01__
[__Linked List__](https://github.com/nadarm/42-algorithm/tree/master/linked_list#linked-list) | __02__
[__Stack__](https://github.com/nadarm/42-algorithm/tree/master/stack#stack) | __03__
[__Queue__](https://github.com/nadarm/42-algorithm/tree/master/queue#queue) | __04__
[__Deque__](https://github.com/nadarm/42-algorithm/tree/master/deque#deque) |
|:---|:---|:---|:---|:---|
||||||
| | *2020 . 03 .02. ~ 03. 08.* | *2020. 03. 09. ~ 03. 22.* | *2020. 03. 23. ~ 03. 29.* | *2020. 03. 30. ~ 04. 05.* |
| | [__01 연결리스트 학습__ ](/01_linked_list#1-linked-list)
[__01-1__ ](/01_linked_list/1_singly_linked_list)singly
[__01-2__ ](/01_linked_list/2_doubly_linked_list)doubly
[__01-3__ ](/01_linked_list/3_circular_linked_list)circular
[__+ baekjoon (2)__ ](/01_linked_list/4_baekjoon) | [__02 스택 학습__ ](/02_stack#2-stack)
[__02-1__ ](/02_stack/1_stack_using_array)using array
[__02-2__ ](/02_stack/2_stack_using_linked_list)using linked list
[__+ baekjoon (5)__ ](/02_stack/3_baekjoon) | [__03 큐 학습__ ](/03_queue#3-queue)
[__03-1__ ](/03_queue/1_queue_using_array)using array
[__03-2__ ](/03_queue/2_queue_using_linked_list)using linked list
[__+ baekjoon(3)__ ](/03_queue/3_baekjoon) | [__04 덱 학습__ ](/04_deque#4-deque)
[__04-1__ ](/04_deque/1_deque_using_linked_list)using linked list
[__+ baekjoon(3)__ ](/04_deque/2_baekjoon)|
| Collection of
Problems | __05__
[__Tree__](https://github.com/nadarm/42-algorithm/tree/master/tree#tree) | __06__
[__Sort__](https://github.com/nadarm/42-algorithm/tree/master/sort#sort) | __07__
[__Hash__](https://github.com/nadarm/42-algorithm/tree/master/hash#hash) | __08__
[__Graph__](https://github.com/nadarm/42-algorithm/tree/master/graph#graph) |
|:---|:---|:---|:---|:---|
||||||
| | *2020. 04. 06. ~ 05. 15.* | *2020. 05. 16. ~ 05. 27.* | *2020. 05. 28. ~ 06. 07.* | *2020. 07. 06. ~ 07. 26.* |
| |[__05 트리 학습__ ](/05_tree#5-tree)
[__05-1__ ](/05_tree/1_binary_search_tree)BST
[__05-2__ ](/05_tree/2_heap)heap
[__05-3__ ](/05_tree/3_trie)trie
[__05-4__ ](/05_tree/4_union_find)union-find
[__+ baekjoon (11)__ ](/05_tree/5_baekjoon) | [__06 정렬 학습__ ](/06_sort#6-sort)
[__06-1__ ](/06_sort/1_bubble_sort)bubble sort
[__06-2__ ](/06_sort/2_heap_sort)heap sort
[__06-3__ ](/06_sort/3_quick_sort)quick sort
[__06-4__ ](/06_sort/4_merge_sort)merge sort
[__+ baekjoon (6)__ ](/06_sort/5_baekjoon) | [__07 해시 학습__ ](/07_hash#7-hash)
[__07-1__ ](/07_hash/1_rabin_karp)rabin-karp
[__07-2__ ](/07_hash/2_hash_set)hash set
[__07-3__ ](/07_hash/3_hash_map)hash map
[__+ baekjoon (7)__ ](/07_hash/4_baekjoon) | [__08 그래프 학습__ ](/08_graph#8-graph)
[__08-1__ ](/08_graph/1_undirected_matrix)undir(matrix)
[__08-2__ ](/08_graph/2_undirected_list)undir(list)
[__08-3__ ](/08_graph/3_directed_list)dir(list)
[__08-4__ ](/08_graph/4_mst)MST
[__08-5__ ](/08_graph/5_shortest_path)shortest path
[__+ baekjoon (13)__ ](/08_graph/6_baekjoon) |