Bubble Sort Algorithm
The Bubble Sort Algorithm is a simple and widely known sorting algorithm used to sort elements in an array, list, or any other data structure. The algorithm works by repeatedly iterating through the list and comparing each adjacent pair of elements. If the elements are out of order, they are swapped, and the process continues until the entire list is sorted. Bubble Sort gets its name from the way smaller elements "bubble" to the top of the list (i.e., the beginning of the array) as larger elements "sink" to the bottom (i.e., the end of the array) during the sorting process. This algorithm has a straightforward implementation and is easy to understand, making it an excellent choice for teaching sorting concepts to beginners.
However, Bubble Sort Algorithm has its limitations, as it is not the most efficient sorting algorithm for large datasets. It has a worst-case and average-case time complexity of O(n^2), where n is the number of items being sorted. This means that the algorithm's performance degrades substantially as the size of the input increases. In practical applications, other sorting algorithms such as Quick Sort, Merge Sort, or Heap Sort are often preferred due to their better performance characteristics. Despite its limitations, Bubble Sort Algorithm remains a fundamental sorting technique and serves as a great introduction to the world of algorithms and computer science.
/*
* Copyright (c) 2017 Kotlin Algorithm Club
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package com.algorithmexamples.sorts
/**
* Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares
* each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated
* until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort,
* is named for the way smaller or larger elements "bubble" to the top of the list. Although the algorithm is simple,
* it is too slow and impractical for most problems even when compared to insertion sort. It can be practical
* if the input is usually in sorted order but may occasionally have some out-of-order elements nearly in position.
*/
@ComparisonSort
@StableSort
class BubbleSort : AbstractSortStrategy() {
public override fun<T : Comparable<T>> perform(arr: Array<T>) {
var exchanged: Boolean
do {
exchanged = false
for (i in 1 until arr.size) {
if (arr[i] < arr[i - 1]) {
arr.exch(i, i - 1)
exchanged = true
}
}
} while (exchanged)
}
}
