This PowerShell script creates a new symbolic link file, linking to a target.
symlink Specifies the file path to the new symlink file
target Specifies the file path to the target
PS> ./new-symlink.ps1 C:\User\Markus\Windows C:\Windows✅ Created new symlink 'C:\User\Markus\Windows' linking to: C:\WindowsAuthor: Markus Fleschutz | License: CC0
This PowerShell script creates a new SSH key for the user.
PS> ./new-ssh-key.ps1✅ New SSH key of Ed25519 type saved to ~/.ssh - your public key is:ssh-ed25519 AAAAC3NzaC1lZDI1NTE5AAAAILb8s5zU9YDApGQ82H45fMKVPMr5cw9fzh3PEBjZZ+Rm markus@PIAuthor: Markus Fleschutz | License: CC0
This PowerShell script generates a new QR code image file.
text Specifies the text to use
imageSize Specifies the image size (width x height)
fileFormat Specifies the image file format
PS> ./new-qrcode.ps1 "Fasten seatbelt" 500x500 JPGAuthor: Markus Fleschutz | License: CC0
This PowerShell script creates an empty new directory in the filesystem.
path Specifies the path and filename of the new directory
PS> ./new-dir.ps1 MyCollection✅ New 📂C:\Temp\MyCollection created.Author: Markus Fleschutz | License: CC0
This PowerShell script creates a new branch in a local Git repository and switches to it.
newBranch Specifies the new Git branch name
pathToRepo Specifies the file path to the local Git repository (current working directory per default)
PS> ./new-branch.ps1 test123⏳ (1/6) Searching for Git executable... git version 2.45.0⏳ (2/6) Checking local repository... C:\Repos\rust⏳ (3/6) Fetching remote updates... git@github.org:rust/rust.git⏳ (4/6) Creating new branch...⏳ (5/6) Pushing updates...⏳ (6/6) Updating submodules...✅ Created branch 'test123' based on 'main' in 📂rust repo in 18s.Author: Markus Fleschutz | License: CC0
This PowerShell script measures the speed of the SelectionSort algorithm. SelectionSort is an in-place comparison sorting algorithm. It has an O(n2) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity and has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.
numIntegers Specifies the number of integers to sort
PS> ./measure-SelectionSort.ps1🧭 0.335 sec to sort 1000 integers by SelectionSortAuthor: Markus Fleschutz | License: CC0
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.
numIntegers Specifies the number of integers to sort
PS> ./measure-QuickSort.ps1🧭 0.085 sec to sort 1000 integers by QuickSortAuthor: Markus Fleschutz | License: CC0
This PowerShell script measures the speed of the MergeSort algorithm. MergeSort is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.
numIntegers Specifies the number of integers to sort
PS> ./measure-MergeSort.ps1🧭 0.378 sec to sorting 1000 integers by MergeSortAuthor: Markus Fleschutz | License: CC0
This PowerShell script measures the speed of the InsertionSort algorithm. InsertionSort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.
numIntegers Specifies the number of integers to sort
PS> ./measure-InsertionSort.ps1🧭 0.423 sec to sort 1000 integers by InsertionSortAuthor: Markus Fleschutz | License: CC0
This PowerShell script measures the speed of the HeapSort algorithm. HeapSort is a comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: like selection sort, heapsort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element from it and inserting it into the sorted region. Unlike selection sort, heapsort does not waste time with a linear-time scan of the unsorted region; rather, heap sort maintains the unsorted region in a heap data structure to more quickly find the largest element in each step.
numIntegers Specifies the number of integers to sort
PS> ./measure-HeapSort.ps1🧭 0.614 sec to sort 1000 integers by HeapSortAuthor: Markus Fleschutz | License: CC0