The Wiert Corner – irregular stream of stuff

Jeroen W. Pluimers on .NET, C#, Delphi, databases, and personal interests

  • My badges

  • Twitter Updates

  • My Flickr Stream

  • Pages

  • All categories

  • Enter your email address to subscribe to this blog and receive notifications of new posts by email.

    Join 4,224 other subscribers

Archive for December 10th, 2021

The IDEA project – an ongoing series of nonverbal algorithm assembly instructions

Posted by jpluimers on 2021/12/10

I wonder how many new algorithms were added, as the first 6 were really impressive: [WayBackIDEA on Twitter: “Excited to announce the IDEA project – an ongoing series of nonverbal algorithm assembly instructions:…”

While originally scheduling this, these were added:


    The gift wrapping algorithm is an algorithm for computing the convex hull of a set of points, the smallest area containing all points that has no inward-pointing dents. You get a similar result when putting a rubber band around some nails in the wall!

  • [WayBack] KVICK SÖRT

    Quicksort is an efficient sorting algorithm based on a divide and conquer approach. Choosing the dividing element at random is a good strategy to avoid bad worst-case runtime.

  • [WayBack] BOGO SÖRT

    Bogo sort, also known as stupid sort, is a simple, but highly inefficient sorting algorithm, which simply shuffles the elements until they are sorted.


    Public-key cryptography can be used for (at least) two purposes: A person’s public key can be used to send encrypted messages to the keys’ owner.

This in addition to the already existing ones:


    Binary search is a fast algorithm for finding the position of a value within a sorted array. It reflects the way people intuitively guess numbers by repeatedly asking Is your number bigger or smaller than x?

  • [WayBack] MERGE SÖRT

    Merge sort is a recursive sorting algorithm based on a divide and conquer approach.

  • [WayBack] BÄLÄNCE TREE

    An AVL tree is a datastructure which guarantees fast search, insertion, and deletion of items. It’s a self-balancing variant of the _binary search tree_.

  • [WayBack] GRÅPH SKÄN

    The graph scan algorithm traverses all reachable nodes in a graph. Its behaviour can be changed by plugging in different datastructures:


    This page describes Fleury’s algorithm, an elegant method to find an Eulerian path in a graph — a path which visits every edge exactly once.


Read the rest of this entry »

Posted in Algorithms, Development, Software Development | Leave a Comment »

Having cancer is not a fight or a battle, it is about having luck or misfortune

Posted by jpluimers on 2021/12/10

It has been a while after my last post about me having cancer. No, I am not giving up. But I am having the regular fear of the upcoming checks: did the metastases return, or do I have the luck to outlive some 30% of my peer group.

The last metastases surgery has been slightly more than a year ago. A year from now, that percentage hopefully will be 50% and slowly increase over time until about 90% in some 9 years from now.

At year’s end, I will know for sure.

Below are some links on, mostly Dutch but with English abstract, articles about the mental side of having cancer, or having survived it for now.

Read the rest of this entry »

Posted in About, Cancer, LifeHacker, Personal, Power User, Rectum cancer | Leave a Comment »

First/Last-Tab: Ctrl-1/9 (or Command-1/9): Switch Between Tabs in Any Browser Using Shortcut Keys

Posted by jpluimers on 2021/12/10

Only recently, I learned this works on just about any web-browser:

  • Ctrl-9 (macOS: Command-9) goes to LAST tab
  • Ctrl-1 (macOS: Command-1) goes go FIRST tab

Via: [WayBack] Switch Between Tabs in Any Browser Using Shortcut Keys

For those keyboard ninjas who hate using the mouse, switching between tabs in your browser window is essential since most people probably have a bunch of tabs open at once. […]

If you want to go to a specific tab, you can press CTRL + N, where N is a number between 1 and 8. Unfortunately, you can’t go past 8, so if you have more than eight tabs, you’ll have to use a different keyboard shortcut or just click on it. CTRL + 9 will take you to the last tab, even if there are more than 8!


Posted in Chrome, Firefox, Internet Explorer, Keyboards and Keyboard Shortcuts, Opera, Power User, Safari, Web Browsers | Leave a Comment »

%d bloggers like this: