don't stop believing

Stack과 대비되는 Queue 입니다. Queue에서는 FIFO(First-In, First-Out)의 개념을 가지고 있습니다. https://en.wikipedia.org/wiki/Queue_(abstract_data_type) Queue (abstract data type) - Wikipedia Representation of a FIFO (first in, first out) queue In computer science, a queue is a collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition..

자료구조 중 스택입니다. Stack과 Queue는 항상 같이 설명됩니다. https://en.wikipedia.org/wiki/Stack_(abstract_data_type) Stack (abstract data type) - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Simple representation of a stack runtime with push and pop operations. In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal en.w..

이진 탐색 트리입니다. https://en.wikipedia.org/wiki/Binary_search_tree Binary search tree - Wikipedia A binary search tree of size 9 and depth 3, with 8 at the root. The leaves are not drawn. In computer science, binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items en.wikipedia.org 이진 탐색 트리는 아래아 같은 조건을 가지고 있습니다. ..

이번에는 자료구조입니다. 이중 연결 리스트는 하나의 노드(데이터)가 앞 뒤 노드를 참조하는 구조입니다. https://en.wikipedia.org/wiki/Doubly_linked_list Doubly linked list - Wikipedia In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains three fields: two link fields (references to the previous and to the next node in the sequence of no en...

배열에서 찾으려는 값이 있는지 이진 검색을 합니다. 배열의 범위를 2분할 하면서 찾는 방법입니다. https://en.wikipedia.org/wiki/Binary_search_algorithm Binary search algorithm - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Search algorithm finding the position of a target value within a sorted array This article is about searching a finite sorted array. For searching continuous function values, see bi..

선형 검색(Linear Search)의 경우 배열의 첫번째 자리에서부터 값을 찾아 값니다. 하지만 찾으려는 값이 뒷쪽에 있다면 효율이 좋지 않기 때문에 하나씩 올라가지 않고 일정 블록을 잡아서 점프해 가며 찾겠습니다. https://en.wikipedia.org/wiki/Jump_search Jump search - Wikipedia In computer science, a jump search or block search refers to a search algorithm for ordered lists. It works by first checking all items Lkm, where k ∈ N {\displaystyle k\in \mathbb {N} } and m is the block size..

이번에는 데이터를 찾는 알고리즘을 확인해 보겠습니다. 처음으로 선형 검색(Linear Search) 입니다. 이건 간단 합니다. 내가 찾으려는 값이 배열의 몇 번째 자리에 있는지 순차적으로 찾는 것입니다. https://en.wikipedia.org/wiki/Linear_search Linear search - Wikipedia In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searche..

Counting Sort는 값을 비교해 정렬하는 방식이 아닌 Key Value 형태의 계산으로 정렬합니다. https://en.wikipedia.org/wiki/Counting_sort Counting sort - Wikipedia In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct key value, en.wikipedia..

Shell Sort는 삽입 정렬(Insertion Sort)을 보완한 정렬 방법입니다. 삽입정렬에서 언급했듯이 어느정도 정렬이 되어 있으면 효율이 높게 나옵니다. https://en.wikipedia.org/wiki/Shellsort Shellsort - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Sorting algorithm which uses multiple comparison intervals The step-by-step process of replacing pairs of items during the shell sorting algorithm. Shellsort, also known as ..

삽입 정렬입니다. 버블정렬과 비슷한데 배열의 1 번 자리에서부터 시작해 뒤로가면서 큰 값을 위치시킵니다. https://en.wikipedia.org/wiki/Insertion_sort Insertion sort - Wikipedia Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provide en.wikiped..