don't stop believing

선형 검색(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..

Heap 자료구조를 이용한 정렬 방법입니다. https://en.wikipedia.org/wiki/Heapsort Heapsort - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search A sorting algorithm which uses the heap data structure In computer science, heapsort is a comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: en.wikipedia.org 먼저 Heap Sort를 이해하려면 Heap 자료구조와 완전이진트리에 대..