1-1 アルゴリズムとは
procedure bubbleSort(A : list of sortable items ) defined as:
for each i in 1 to length(A) - 1 do:
for each j in 2 to length(A) - i + 1 do:
if A[ j ] < A[ j - 1 ] then
swap( A[ j ], A[ j - 1 ] )
end if
end for
end for
end procedure
例）バブルソートのアルゴリズム
1-5 「アルゴリズム図鑑」開発秘話
● 評価
iOS:約 4.9 Android: 約 4.6
● レビュー
“Love it! I will buy the full version. The explanation style is top class.”
“Excellent instructions for complicated topics. The small price for this
app is worth it, as it will significantly improve your understanding and
intuition with many modern algorithms.”
“1000年にひとつの神アプリ”
![1-1 アルゴリズムとは
procedure bubbleSort( A : list of sortable items ) defined as:
for each i in 1 to length(A) - 1 do:
for each j in 2 to length(A) - i + 1 do:
if A[ j ] < A[ j - 1 ] then
swap( A[ j ], A[ j - 1 ] )
end if
end for
end for
end procedure
例）バブルソートのアルゴリズム](https://image.slidesharecdn.com/random-171003015028/75/slide-12-2048.jpg)
