일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- Jupyter Notebook
- nmap
- postgresql
- Materials
- nohup
- 실행권한
- insert
- kitura
- centos
- 28015
- openpyxl
- appium
- PYTHON
- sshpass
- perfect
- SWIFT
- postgres
- mysql
- ftp
- Jupyter
- port forwarding
- STF_PortForwarding
- ssh
- appium server
- ubuntu
- rethinkdb
- STF
- create table
- GoCD
- nGrinder
- Today
- Total
목록2019/05 (13)
don't stop believing
삽입 정렬입니다. 버블정렬과 비슷한데 배열의 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 자료구조와 완전이진트리에 대..
Odd-Even Sort입니다. 홀짝 정렬이라고도 합니다. 기본적으로 버블정렬과 같지만 홀수자리와 짝수자리를 나눠 비교해 정렬합니다. https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort Odd–even sort - Wikipedia In computing, an odd–even sort or odd–even transposition sort (also known as brick sort[1][self-published source]) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a..