mirror of
https://github.com/fleschutz/PowerShell.git
synced 2024-11-25 01:14:16 +01:00
2.9 KiB
2.9 KiB
measure-BubbleSort.ps1
This PowerShell script measures the speed of the BubbleSort algorithm. BubbleSort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until 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.
Parameters
PS> ./measure-BubbleSort.ps1 [[-numIntegers] <Int32>] [<CommonParameters>]
-numIntegers <Int32>
Specifies the number of integers to sort
Required? false
Position? 1
Default value 1000
Accept pipeline input? false
Accept wildcard characters? false
[<CommonParameters>]
This script supports the common parameters: Verbose, Debug, ErrorAction, ErrorVariable, WarningAction,
WarningVariable, OutBuffer, PipelineVariable, and OutVariable.
Example
PS> ./measure-BubbleSort.ps1
🧭 Sorting 1000 integers by BubbleSort took 0.7291663 sec
Notes
Author: Markus Fleschutz | License: CC0
Related Links
https://github.com/fleschutz/PowerShell
Script Content
<#
.SYNOPSIS
Measures the speed of BubbleSort
.DESCRIPTION
This PowerShell script measures the speed of the BubbleSort algorithm.
BubbleSort is a simple sorting algorithm that repeatedly steps through the list,
compares adjacent elements and swaps them if they are in the wrong order. The pass
through the list is repeated until 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.
.PARAMETER numIntegers
Specifies the number of integers to sort
.EXAMPLE
PS> ./measure-BubbleSort.ps1
🧭 Sorting 1000 integers by BubbleSort took 0.7291663 sec
.LINK
https://github.com/fleschutz/PowerShell
.NOTES
Author: Markus Fleschutz | License: CC0
#>
param([int]$numIntegers = 1000)
class BubbleSort {
static Sort($targetList) {
$n = $targetList.Count
for ($i = 0; $i -lt $n; $i+=1) {
for ($j = 0; $j -lt $n-1; $j+=1) {
if($targetList[$j] -gt $targetList[$j+1]) {
$temp = $targetList[$j+1]
$targetList[$j+1]=$targetList[$j]
$targetList[$j]=$temp
}
}
}
}
}
$list = (1..$NumIntegers | foreach{Get-Random -minimum 1 -maximum $numIntegers})
$stopWatch = [system.diagnostics.stopwatch]::startNew()
[BubbleSort]::Sort($list)
[float]$elapsed = $stopWatch.Elapsed.TotalSeconds
"🧭 Sorting $numIntegers integers by BubbleSort took $elapsed sec"
exit 0 # success
(generated by convert-ps2md.ps1 using the comment-based help of measure-BubbleSort.ps1 as of 09/01/2023 17:51:53)