Preface :
Teachers often have the chore of putting exams in alphabetical order before returning them to students. By looking in on the process, we discover the insertion algorithm. Initially, the papers are in random order. Assuming that the first name is correctly positioned, the sort begins with the name on the second paper. If that paper is out of order, it is moved forward to the front of the pile. The third name might be in order (name3 > name2). If not, it is moved forward in front of the second paper and compared. If it is still out of order, it is forward in front of the first paper. Repeat the process for the forth, fifth and subsequent names. By successive comparison of the name on the new paper with each preceding paper, we find the place to insert the new paper. Let us look at the insertion sort algorithm for the list of file names : Monre, Chin, Flores, Stein and Dare :
The method insertionSort() takes an array arr as an argument and implements the insertion sort algorithm. Assume that n is the length of the array. The ordering assumes that the first element is in its correct position, so the method requires n-1 passes in the range from 1 to n-1 to order the remaining elements. The following is a generic version of insertionSort(). The method assumes arr is a generic array of elements whose type implements theComparable interface :
Below is the sample code to test the method insertionSort() :
Output : (one possible)
Insertion Sort Efficiency :
Assuming that n is the length of the array, the insertion sort requires n-1 passes. For a general pass i, the insertion occurs in the sublist arr[0] to arr[i-1] and requires on the average i/2 comparisons. The average total number of comparisons is :
T(n) = 1/2 + 2/2 + 3/2 + ... + (n-2)/2 + (n-2)/2 = n(n-1)/4
From the dominant term in T(n), the average-case running time of the algorithm is O(n2^2), which measures the number of comparisons. The best case occurs when the original list is already sorted. In step i, the insertion occurs at arr[i] after only one comparison. The total number of comparisons is n-1, with running time O(n). The worst case has the running time O(n^2).
In general, the insertion sort exhibits the best performance among the quadratic sorting algorithms. The quadratic algorithms are efficient for a list having a small number of elements, say n<= 15. Recall that the insertion sort is linear (O(n)) when the list is already sorted. The insertion sort is still linear when the list is "almost sorted". This condition occurs when many of its elements are already in their correct places. Some more advanced sorting algorithms exploit this fact by partially ordering an array with an O(nlog2(n)) sorting algorithm such as quicksort.
This is a blog to track what I had learned and share knowledge with all who can take advantage of them
標籤
- [ 英文學習 ]
- [ 計算機概論 ]
- [ 深入雲計算 ]
- [ 雜七雜八 ]
- [ Algorithm in Java ]
- [ Data Structures with Java ]
- [ IR Class ]
- [ Java 文章收集 ]
- [ Java 代碼範本 ]
- [ Java 套件 ]
- [ JVM 應用 ]
- [ LFD Note ]
- [ MangoDB ]
- [ Math CC ]
- [ MongoDB ]
- [ MySQL 小學堂 ]
- [ Python 考題 ]
- [ Python 常見問題 ]
- [ Python 範例代碼 ]
- [心得扎記]
- [網路教學]
- [C 常見考題]
- [C 範例代碼]
- [C/C++ 範例代碼]
- [Intro Alg]
- [Java 代碼範本]
- [Java 套件]
- [Linux 小技巧]
- [Linux 小學堂]
- [Linux 命令]
- [ML In Action]
- [ML]
- [MLP]
- [Postgres]
- [Python 學習筆記]
- [Quick Python]
- [Software Engineering]
- [The python tutorial]
- 工具收集
- 設計模式
- 資料結構
- ActiveMQ In Action
- AI
- Algorithm
- Android
- Ansible
- AWS
- Big Data 研究
- C/C++
- C++
- CCDH
- CI/CD
- Coursera
- Database
- DB
- Design Pattern
- Device Driver Programming
- Docker
- Docker 工具
- Docker Practice
- Eclipse
- English Writing
- ExtJS 3.x
- FP
- Fraud Prevention
- FreeBSD
- GCC
- Git
- Git Pro
- GNU
- Golang
- Gradle
- Groovy
- Hadoop
- Hadoop. Hadoop Ecosystem
- Java
- Java Framework
- Java UI
- JavaIDE
- JavaScript
- Jenkins
- JFreeChart
- Kaggle
- Kali/Metasploit
- Keras
- KVM
- Learn Spark
- LeetCode
- Linux
- Lucene
- Math
- ML
- ML Udemy
- Mockito
- MPI
- Nachos
- Network
- NLP
- node js
- OO
- OpenCL
- OpenMP
- OSC
- OSGi
- Pandas
- Perl
- PostgreSQL
- Py DS
- Python
- Python 自製工具
- Python Std Library
- Python tools
- QEMU
- R
- Real Python
- RIA
- RTC
- Ruby
- Ruby Packages
- Scala
- ScalaIA
- SQLAlchemy
- TensorFlow
- Tools
- UML
- Unix
- Verilog
- Vmware
- Windows 技巧
- wxPython
訂閱:
張貼留言 (Atom)
[Git 常見問題] error: The following untracked working tree files would be overwritten by merge
Source From Here 方案1: // x -----删除忽略文件已经对 git 来说不识别的文件 // d -----删除未被添加到 git 的路径中的文件 // f -----强制运行 # git clean -d -fx 方案2: 今天在服务器上 gi...
-
前言 : 為什麼程序管理這麼重要呢?這是因為: * 首先,本章一開始就談到的,我們在操作系統時的各項工作其實都是經過某個 PID 來達成的 (包括你的 bash 環境), 因此,能不能進行某項工作,就與該程序的權限有關了。 * 再來,如果您的 Linux 系統是個...
-
屬性 : 系統相關 - 檔案與目錄 語法 : du [參數] [檔案] 參數 | 功能 -a | 顯示目錄中個別檔案的大小 -b | 以bytes為單位顯示 -c | 顯示個別檔案大小與總和 -D | 顯示符號鏈結的來源檔大小 -h | Hum...
-
來源自 這裡 說明 : split 是 Perl 中非常有用的函式之一,它可以將一個字串分割並將之置於陣列中。若無特別的指定,該函式亦使用 RE 與 $_ 變數 語法 : * split /PATTERN/,EXPR,LIMIT * split /...
沒有留言:
張貼留言