extern/PowerShell
1
0
Fork 0
mirror of https://github.com/fleschutz/PowerShell.git synced 2025-02-17 02:01:01 +01:00
Code Issues Packages Projects Releases Wiki Activity

Update measure-QuickSort.ps1

Browse Source
This commit is contained in:
Markus Fleschutz 2023-08-21 20:42:19 +02:00
parent b9b6e0aa2f
commit 9c5a7849f2
1 changed files with 21 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
Scripts/measure-QuickSort.ps1
View File

@ -1,4 +1,24 @@
param([int]$numIntegers = 1000) <#
.SYNOPSIS
Measures the speed of QuickSort
.DESCRIPTION
This PowerShell script measures the speed of the QuickSort algorithm.
QuickSort is an in-place sorting algorithm. Developed by British computer scientist
Tony Hoare in 1959 and published in 1961, it is still a commonly used algorithm for
sorting. When implemented well, it can be somewhat faster than merge sort and about
two or three times faster than heapsort.
.PARAMETER numIntegers
Specifies the number of integers to sort
.EXAMPLE
PS> ./measure-QuickSort.ps1
🕒 QuickSort of 1000 integers took 0.0853411 sec
.LINK
https://github.com/fleschutz/PowerShell
.NOTES
Author: Markus Fleschutz | License: CC0
#>
param([int]$numIntegers = 1000)
class QuickSort { class QuickSort {
static Sort($targetList, $left, $right) { static Sort($targetList, $left, $right) {