일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- sshpass
- postgresql
- 28015
- port forwarding
- rethinkdb
- perfect
- STF
- create table
- postgres
- ssh
- nmap
- kitura
- nGrinder
- Materials
- Jupyter
- nohup
- centos
- appium server
- GoCD
- STF_PortForwarding
- ubuntu
- PYTHON
- ftp
- openpyxl
- SWIFT
- appium
- mysql
- insert
- 실행권한
- Jupyter Notebook
- Today
- Total
목록2019/05/09 (2)
don't stop believing
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 ..