PowerShell/Scripts/measure-BucketSort.ps1

68 lines
2.3 KiB
PowerShell
Raw Normal View History

2023-08-21 20:11:05 +02:00
<#
.SYNOPSIS
2023-08-21 21:23:10 +02:00
Measures the speed of BucketSort
2023-08-21 20:11:05 +02:00
.DESCRIPTION
2023-08-21 21:23:10 +02:00
This PowerShell script measures the speed of the BucketSort algorithm.
BucketSort is a sorting algorithm that works by distributing the elements
2023-08-21 20:11:05 +02:00
of an array into a number of buckets. Each bucket is then sorted individually,
either using a different sorting algorithm, or by recursively applying the bucket
sorting algorithm. It is a distribution sort, a generalization of pigeonhole sort
that allows multiple keys per bucket, and is a cousin of radix sort in the
most-to-least significant digit flavor. Bucket sort can be implemented with comparisons
and therefore can also be considered a comparison sort algorithm. The computational
complexity depends on the algorithm used to sort each bucket, the number of buckets
to use, and whether the input is uniformly distributed.
.PARAMETER numIntegers
2023-08-21 21:23:10 +02:00
Specifies the number of integers to sort
2023-08-21 20:11:05 +02:00
.EXAMPLE
2023-08-21 21:23:10 +02:00
PS> ./measure-BucketSort.ps1
🧭 Sorting 1000 integers by BucketSort took 0.0653755 sec
2023-08-21 20:11:05 +02:00
.LINK
2023-08-21 21:23:10 +02:00
https://github.com/fleschutz/PowerShell
2023-08-21 20:11:05 +02:00
.NOTES
2023-08-21 21:23:10 +02:00
Author: Markus Fleschutz | License: CC0
2023-08-21 20:11:05 +02:00
#>
param([int]$numIntegers = 1000)
class BucketSort {
static Sort($targetList) {
$max = $targetList[0]
$min = $targetList[0]
for ($i = 1; $i -lt $targetList.Count; $i++) {
if ($targetList[$i] -gt $max) { $max = $targetList[$i] }
if ($targetList[$i] -lt $min) { $min = $targetList[$i]}
}
$holder = New-Object object[][] ($max - $min + 1)
for ($i = 0; $i -lt $holder.Count; $i++) {
$holder[$i] = @()
}
for ($i = 0; $i -lt $targetList.Count; $i++) {
$holder[$targetList[$i] - $min]+=$targetList[$i]
}
$k = 0
for ($i = 0; $i -lt $holder.Count; $i++) {
if ($holder[$i].Count -gt 0) {
for ($j = 0; $j -lt $holder[$i].Count; $j++) {
$targetList[$k] = $holder[$i][$j]
$k++
}
}
}
}
}
$list = (1..$numIntegers | foreach{Get-Random -minimum 1 -maximum $numIntegers})
$stopWatch = [system.diagnostics.stopwatch]::startNew()
[BucketSort]::Sort($list)
[float]$elapsed = $stopWatch.Elapsed.TotalSeconds
2023-08-21 21:23:10 +02:00
"🧭 Sorting $numIntegers integers by BucketSort took $elapsed sec"
exit 0 # success