R1D22 More Sorting and Searching Algorithms in C#

| programming | dotnet |

I kept working on the third course in the C# series on edX. We went over insertion sort, selection sort, linear search, and binary search.

The best part about this course is the videos that show an animation of how each of these algorithms actually works. This was a topic that I struggled with a lot during my CS degree so if you are unsure of how a specific algorithms works either watch a video that steps through it piece by piece, or use a debugger to walk through the code sample. For example the video below is from the course that walks through what binary search looks like.

[youtube https://www.youtube.com/watch?v=aK-gfRD2HQw?rel=0&w=560&h=315]

After going over some basic sorting and searching algorithms we moved on to algorithm analysis and I reunited with my treasured old friend; “Big O notation”.

Studying CS feels like a long lesson in futility sometimes. It is summarized by this quote form the course:

In fact, some in the industry argue that algorithm analysis is a futile task today based on computing hardware resources and the cost of programmer time to do the analysis.
Despite this, I still think the basics are worth knowing.

Functional Programming Humble Bundle

In other news, there was yet another programming related Humble Bundle this week that offers a ton of books about functional programming languages from O'Rielly. Naturally I picked it up and added it to my endless books that I may never get around to reading. For $15, this is a treasure trove so I highly recommend everyone take a look.

Thank you for reading! Share your thoughts with me on bluesky, mastodon, or via email.

Check out some more stuff to read down below.

Most popular posts this month

Recent Favorite Blog Posts

This is a collection of the last 8 posts that I bookmarked.

Articles from blogs I follow around the net

The year of technoligarchy

In 2025, Trump brought tech executives into power to dismantle regulators and write their own rules. But the instabilities they’re creating may be their downfall.

via Citation Needed January 7, 2026

we are here. Performance at Beyond Tellerrand

This performance has been years in the making. In a sense, you could say it’s been a lifetime in the making. On November 6th, 2025, my brother Ian and I gave a “talk” at the amazing Beyond Tellerrand conference in […]

via Blog – Brad Frost January 7, 2026

Pluralistic: Writing vs AI (07 Jan 2026)

Today's links Writing vs AI: If you wouldn't ask an AI to eat a delicious pizza for you, why would you ask it to write a college essay? Hey look at this: Delights to delectate. Object permanence: WELL State of the World; A poem in 30m logfiles; We…

via Pluralistic: Daily links from Cory Doctorow January 7, 2026

Generated by openring