{"id":27419727,"url":"https://github.com/365kim/algorithm_study","last_synced_at":"2026-03-07T22:31:35.940Z","repository":{"id":113114996,"uuid":"244354927","full_name":"365kim/algorithm_study","owner":"365kim","description":"@dev-jko 와 함께하는 42알고리즘 스터디","archived":false,"fork":false,"pushed_at":"2022-08-27T04:47:12.000Z","size":392,"stargazers_count":12,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-08-10T00:22:18.961Z","etag":null,"topics":["algorithm","data-structures"],"latest_commit_sha":null,"homepage":"https://github.com/nadarm/42-algorithm","language":"C","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/365kim.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,"zenodo":null}},"created_at":"2020-03-02T11:33:23.000Z","updated_at":"2023-11-19T10:29:54.000Z","dependencies_parsed_at":"2023-07-04T22:15:53.310Z","dependency_job_id":null,"html_url":"https://github.com/365kim/algorithm_study","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/365kim/algorithm_study","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/365kim%2Falgorithm_study","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/365kim%2Falgorithm_study/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/365kim%2Falgorithm_study/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/365kim%2Falgorithm_study/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/365kim","download_url":"https://codeload.github.com/365kim/algorithm_study/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/365kim%2Falgorithm_study/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30234509,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-07T19:01:10.287Z","status":"ssl_error","status_checked_at":"2026-03-07T18:59:58.103Z","response_time":53,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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","data-structures"],"created_at":"2025-04-14T10:09:07.236Z","updated_at":"2026-03-07T22:31:35.921Z","avatar_url":"https://github.com/365kim.png","language":"C","readme":"## Data Sturcture \u0026 Algorithm\n\n### :runner: Study Mento  : [**nadarm**](https://github.com/nadarm/42-algorithm) (aka jko)\n\n### :memo: Definition\n- `자료구조` : 데이터를 효율적으로 이용할 수 있도록 컴퓨터에 저장하는 방법\n    - 데이터의 특성에 따라 분류하여 구성하고 저장 및 처리하는 모든 작업을 의미\n    - 데이터 처리의 성능과 효율에 직접적으로 영향을 끼치기 때문에 실제 데이터들의 관계를 잘 반영해야 함\n- `알고리즘` : 자료구조로 표현된 데이터들을 처리하는 절차\n\n- `Big-O 표기법` : 입력의 크기에 따라 근사적으로 성능을 표기하는 방법\n    - 알고리즘의 시간복잡도와 공간복잡도를 나타내는데 사용\n    - 성능은 항상 최선, 평균, 최악 중 보장의 의미가 있는 최악의 경우로 얘기해야 함\n    - 시간복잡도 _(cpu)_ 가 공간복잡도 _(memory)_ 보다 중요\n---\n\n### :memo: Contents\n- Curriculum designed by [**nadarm**](https://github.com/nadarm/42-algorithm)\n\n    | Collection of　 \u003cbr\u003eProblems　  | __01__ \u003cbr\u003e [__Linked List__](https://github.com/nadarm/42-algorithm/tree/master/linked_list#linked-list) | __02__ \u003cbr\u003e [__Stack__](https://github.com/nadarm/42-algorithm/tree/master/stack#stack) | __03__ \u003cbr\u003e [__Queue__](https://github.com/nadarm/42-algorithm/tree/master/queue#queue) | __04__ \u003cbr\u003e [__Deque__](https://github.com/nadarm/42-algorithm/tree/master/deque#deque) |\n    |:---|:---|:---|:---|:---|\n    ||||||\n    | 　 | *2020 . 03 .02. ~ 03. 08.*  | *2020. 03. 09. ~ 03. 22.* | *2020. 03. 23. ~ 03. 29.* | *2020. 03. 30. ~ 04. 05.* |\n    | 　 |  [__01 연결리스트 학습__ ](/01_linked_list#1-linked-list) \u003cbr\u003e\u003cbr\u003e [__01-1__ ](/01_linked_list/1_singly_linked_list)singly \u003cbr\u003e [__01-2__ ](/01_linked_list/2_doubly_linked_list)doubly \u003cbr\u003e [__01-3__ ](/01_linked_list/3_circular_linked_list)circular \u003cbr\u003e\u003cbr\u003e [__+ baekjoon (2)__ ](/01_linked_list/4_baekjoon) | [__02 스택 학습__ ](/02_stack#2-stack) \u003cbr\u003e\u003cbr\u003e[__02-1__ ](/02_stack/1_stack_using_array)using array\u003cbr\u003e  [__02-2__ ](/02_stack/2_stack_using_linked_list)using linked list\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e [__+ baekjoon (5)__ ](/02_stack/3_baekjoon)  |  [__03 큐 학습__ ](/03_queue#3-queue) \u003cbr\u003e\u003cbr\u003e [__03-1__ ](/03_queue/1_queue_using_array)using array \u003cbr\u003e [__03-2__ ](/03_queue/2_queue_using_linked_list)using linked list \u003cbr\u003e\u003cbr\u003e\u003cbr\u003e [__+ baekjoon(3)__ ](/03_queue/3_baekjoon)  |  [__04 덱 학습__ ](/04_deque#4-deque) \u003cbr\u003e\u003cbr\u003e[__04-1__ ](/04_deque/1_deque_using_linked_list)using linked list \u003cbr\u003e\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e [__+ baekjoon(3)__ ](/04_deque/2_baekjoon)|\n    \n    | Collection of　 \u003cbr\u003eProblems　 | __05__ \u003cbr\u003e [__Tree__](https://github.com/nadarm/42-algorithm/tree/master/tree#tree) | __06__ \u003cbr\u003e [__Sort__](https://github.com/nadarm/42-algorithm/tree/master/sort#sort) | __07__ \u003cbr\u003e [__Hash__](https://github.com/nadarm/42-algorithm/tree/master/hash#hash) | __08__ \u003cbr\u003e [__Graph__](https://github.com/nadarm/42-algorithm/tree/master/graph#graph) |\n    |:---|:---|:---|:---|:---|\n    ||||||\n    | 　 | *2020. 04. 06. ~ 05. 15.* | *2020. 05. 16. ~ 05. 27.* | *2020. 05. 28. ~ 06. 07.* | *2020. 07. 06. ~ 07. 26.* |\n    | 　 |[__05 트리 학습__ ](/05_tree#5-tree) \u003cbr\u003e\u003cbr\u003e[__05-1__ ](/05_tree/1_binary_search_tree)BST \u003cbr\u003e [__05-2__ ](/05_tree/2_heap)heap \u003cbr\u003e [__05-3__ ](/05_tree/3_trie)trie \u003cbr\u003e [__05-4__ ](/05_tree/4_union_find)union-find\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e [__+ baekjoon (11)__ ](/05_tree/5_baekjoon) | [__06 정렬 학습__ ](/06_sort#6-sort) \u003cbr\u003e\u003cbr\u003e [__06-1__ ](/06_sort/1_bubble_sort)bubble sort \u003cbr\u003e [__06-2__ ](/06_sort/2_heap_sort)heap sort \u003cbr\u003e [__06-3__ ](/06_sort/3_quick_sort)quick sort \u003cbr\u003e [__06-4__ ](/06_sort/4_merge_sort)merge sort \u003cbr\u003e\u003cbr\u003e\u003cbr\u003e [__+ baekjoon (6)__ ](/06_sort/5_baekjoon) | [__07 해시 학습__ ](/07_hash#7-hash) \u003cbr\u003e\u003cbr\u003e [__07-1__ ](/07_hash/1_rabin_karp)rabin-karp \u003cbr\u003e [__07-2__ ](/07_hash/2_hash_set)hash set \u003cbr\u003e [__07-3__ ](/07_hash/3_hash_map)hash map \u003cbr\u003e\u003cbr\u003e\u003cbr\u003e\u003cbr\u003e [__+ baekjoon (7)__ ](/07_hash/4_baekjoon)  | [__08 그래프 학습__ ](/08_graph#8-graph) \u003cbr\u003e\u003cbr\u003e [__08-1__ ](/08_graph/1_undirected_matrix)undir(matrix) \u003cbr\u003e [__08-2__ ](/08_graph/2_undirected_list)undir(list) \u003cbr\u003e [__08-3__ ](/08_graph/3_directed_list)dir(list) \u003cbr\u003e [__08-4__ ](/08_graph/4_mst)MST \u003cbr\u003e [__08-5__ ](/08_graph/5_shortest_path)shortest path \u003cbr\u003e\u003cbr\u003e [__+ baekjoon (13)__ ](/08_graph/6_baekjoon) |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F365kim%2Falgorithm_study","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F365kim%2Falgorithm_study","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F365kim%2Falgorithm_study/lists"}