Preface :
Array-based sorting algorithm deal with a sequence of elements in a list and use some rearrangement strategy to order the elements. We begin with a very simple example, called the selection sort, that proceeds through the list position by position. Let use illustrate these ideas with a discussion of the selection sort algorithm. A sample problem has us arranging an array of four animals in ascending order of their size :
Selection Sort Algorithm :
We develop the selection sort algorithm for an array of n elements. The resulting list is in ascending order with :
arr[0] <= arr[1] <= arr[2] ... <= arr[n-2] <= arr[n-1]
The algorithm starts at index 0 and determines the position of the smallest element in the list. An exchange swaps the element at the position with arr[0] and leaves the rest of the list in unsorted order. Take some procedure on the rest of the list until the index reaches the end of the list.
Let's assume arr is an integer array with n=5 elements having values {50, 20, 40, 75, 35}. Below figure displays how we sort the list with selection sort algorithm :
The SelectionSort Method :
The static method selectionSort() in the class Arrays implements the algorithm for an integer array. Its signature includes the array arr as the parameter. The implementation of the method consists of nested for-loops. The outer loop establishes the n-1 passes over the array where n is the length of the array. The control variable, called pass, ranges from 0 to n-2, For each iteration, an inner loop scans the unordered sub-list arr[pass] to arr[n-1] and assigns to the variable smallIndex the position of the smallest element. An exchange between arr[pass] and arr[smallIndex] complete the iteration and places element arr[smallIndex] to its correct position in the final sorted list.
Supplement :
* [ 資料結構 小學堂 ] 排序 : 選擇排序法
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...
-
Understanding the core indexing classes : As you saw in our Indexer class ( A simple application ), you need the following classes to...
-
轉載自 這裡 前言 : 歡迎來到二進位的世界。電腦資料都是以二進位儲存,想當然程式語言的變數也都是以二進位儲存。在 C/C++ 當中有幾個位元運算子: << SHIFT LEFT 、 >> SHIFT RIGHT 、 & AND 、 ...
-
屬性 : 系統相關 - 檔案與目錄 語法 : du [參數] [檔案] 參數 | 功能 -a | 顯示目錄中個別檔案的大小 -b | 以bytes為單位顯示 -c | 顯示個別檔案大小與總和 -D | 顯示符號鏈結的來源檔大小 -h | Hum...
沒有留言:
張貼留言