Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- ssh
- insert
- openpyxl
- 실행권한
- Jupyter
- Materials
- nmap
- STF
- kitura
- port forwarding
- GoCD
- postgres
- mysql
- nGrinder
- SWIFT
- PYTHON
- ubuntu
- Jupyter Notebook
- appium
- ftp
- rethinkdb
- centos
- perfect
- STF_PortForwarding
- 28015
- sshpass
- nohup
- create table
- appium server
- postgresql
Archives
- Today
- Total
목록2019/04/29 (1)
don't stop believing
Comb Sort - 빗질 정렬
버블 정렬과 비슷한 계념으로 비교 대상을 배열의 앞과 뒤에서부터 시작하며 그 간격을 좁혀가며 정렬하는 방법입니다. https://en.wikipedia.org/wiki/Comb_sort Comb sort - Wikipedia From Wikipedia, the free encyclopedia Jump to navigation Jump to search Interval based sorting algorithm Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz in 1980.[1][2] Later it was rediscovered by Stephen L en.wikipedia.or..
Golang/Basic
2019. 4. 29. 17:13