Category: C#

Using the Security.Cryptography class, you can encrypt and decrypt files pretty easily. I was experimenting with taking a plaintext message, encrypting that message into a text file, and then reading and decrypting the message. Something that fascinates me is the encryption key is stored and can be extrapolated from the text file. Compiled in Microsoft Read More …

Permutation Sort is a sorting algorithm based on generating all permutations of the given input and then selecting the sorted one. While conceptually simple, it’s impractical for large datasets due to its extremely high time complexity.   How Permutation Sort Works: Find the Range: Identify the minimum and maximum values in the input array to Read More …

Bucket Sort is a distribution-based sorting algorithm that works by dividing the input array into several “buckets,” sorting each bucket individually, and then combining the results. It is effective when the input data is uniformly distributed over a range.   How Bucket Sort Works: Create Buckets: Divide the input elements into several groups (buckets). The Read More …

Radix Sort is a non-comparative integer sorting algorithm that sorts numbers by processing individual digits. It processes the digits from the least significant digit (LSD) to the most significant digit (MSD) or vice versa. Radix Sort works by distributing numbers into buckets according to each digit, then recombining them in a sorted order.   How Read More …