Re: [問題] Bubble sort
※ 引述《ian60702 (pacific hero)》之銘言：
: 有關Algorithms 的題目
: Write an algorithm in pseudocode for the selection sort using two nested loop
Selection Sort
for i ← 0 to n-2 do
{
min ← i
for j ← (i + 1) to n-1 do
{
if A[j] < A[min]
min ← j
}
swap ( A[i] , A[min] )
}
Time Complexity (Best/Avg./Worst) : Θ( n^2 )
Bubble Sort
do
{
swapped ← false
n ← n - 1
for i ← 0 to n - 1 do
{
if A[i] > A[i + 1]
{
swap( A[i] , A[i + 1] )
swapped ← true
}
}
}while swapped
Time Complexity Best : Θ( n )
Time Complexity Avg./Worst : Θ( n^2 )
--
男子漢﹐就算是在最痛苦的時候﹐也要笑。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.45.58.229
※ 編輯: avogau 來自: 114.45.58.229 (12/29 13:12)
→
12/29 18:46, , 1F
12/29 18:46, 1F
推
12/29 22:51, , 2F
12/29 22:51, 2F
討論串 (同標題文章)