bih

MergeSort Algorithm in Ruby

When learning about sorting algorithms, I wanted to implement them to help me understand them better. This algorithm was originally invented by John von Neumann in 1948.

The Ruby script attached explains in real code what is going on. Play about with it.

How does the algorithm work?

Step by step:

• Pass through an array of unsorted numbers (i.e. [4, 3, 2, 10])

hedning

#!/usr/bin/env nix-shell
#! nix-shell -i python3 -p python3.pkgs.dbus-python

import dbus
import time
bus = dbus.SessionBus()
obj = bus.get_object("org.gnome.Shell", "/org/gnome/Shell/Screencast")

obj.Screencast("Auto %d %t.webm", [],
               dbus_interface="org.gnome.Shell.Screencast")