Jonkman Microblog
  • Login
Show Navigation

  • Public

    • Public
    • Network
    • Groups
    • Popular
    • People

Conversation

Notices

  1. clacke: inhibited exhausted pixie dream boy πŸ‡ΈπŸ‡ͺπŸ‡­πŸ‡°πŸ’™πŸ’› (clacke@libranet.de)'s status on Saturday, 15-Jun-2024 09:35:53 EDT clacke: inhibited exhausted pixie dream boy 🇸🇪🇭🇰💙💛 clacke: inhibited exhausted pixie dream boy πŸ‡ΈπŸ‡ͺπŸ‡­πŸ‡°πŸ’™πŸ’›

    "Over 70 Sorting Algorithms in Under an Hour - Linked Disparity Dots"

    farside.link/invidious/watch?v…

    youtube.com/watch?v=f0zcl5ERS8…

    /via libranet.de/display/0b6b25a8-2…

    #visualization #audibilization
    #SortingOutSorting #SoundOfSorting

    In conversation about a year ago from libranet.de permalink
    1. clacke: inhibited exhausted pixie dream boy πŸ‡ΈπŸ‡ͺπŸ‡­πŸ‡°πŸ’™πŸ’› (clacke@libranet.de)'s status on Saturday, 15-Jun-2024 10:10:08 EDT clacke: inhibited exhausted pixie dream boy 🇸🇪🇭🇰💙💛 clacke: inhibited exhausted pixie dream boy πŸ‡ΈπŸ‡ͺπŸ‡­πŸ‡°πŸ’™πŸ’›
      in reply to

      It is still mesmerizing. Not sure if I can really learn anything from it though. πŸ˜ƒ

      Bitonic searches are completely mind-boggling to see.

      Some searches you can kind of get. Some are iteratively monotonically improving sortedness, and that's easy to see. Flower petals mean that a region is internally well-sorted but contains values from the full set, and you can recognize when those exist and are later merged.

      In conversation about a year ago from libranet.de permalink
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

Jonkman Microblog is a social network, courtesy of SOBAC Microcomputer Services. It runs on GNU social, version 1.2.0-beta5, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All Jonkman Microblog content and data are available under the Creative Commons Attribution 3.0 license.

Switch to desktop site layout.