Seems straightforward enough. For j values of 1 to i it will not do anything because the largest element in the array has already been moved to position i in some earlier iteration in the i loop. For j values greater than i it then proceeds to find the largest remaining element place in position i.

Edit: I'm leaving my incorrect thought above as is for posterity. As pointed out when j is less than i it does of course swap again resulting in a more difficult (for me) visualization of what the end result looks like. Time to have some fun with it (could read about it, but programming is more fun and I like to experiment).

Git, vcpkg, cmake, winget, lazygit, powershell commands (don't know enough but never take enough time to learn more in depth, web searches for what I need at the time)

"After removing Holiday's Ad Restrictions We estimate we can sell up to 80% of a user's vision without inducing seizures" - Nolan Sorrento

Thanks to AI they won't need as many wage slaves. The future looks bright!

There is NostalgiaTV for Android devices for accessing plex as a collection of TV channels (customizable). The developer is very active on his discord responding to bug reports and feature requests. Caveat, not open source, and paid, which may not be everyone's cup of tea.

Seems suitable for the annual Festivus airing of grievances.

I use https://github.com/slackhq/nebula. Maybe a little more work than tailscale, but I'm happy with it.