1. Made with Processing.

    Playing again with text data. The goal was to write an effective and fast algorithm for sorting text in an alphabetical order using the 'divide and conquer' method / recursion which would work with my written 'Word' class (the Word class I've written saves the String data, how often it appears in text and the positions in the original text).

    Visualization rules:
    Circle == one word of the original text
    Circle size indicates how often the word is used (big circle > the word is used often, small circle > the word is used less)
    Red outline shows the length of the current word (thicker > more letters), but only if the stroke weight is thinner than the diameter of the circle
    Outer position (big circle) == alphabetical sorted word list
    Inner position (small circle) == original position(s) in text
    Line between original position(s) and position in alphabetical sorted word list

    Code:
    http://openprocessing.org/visuals/?visualID=44133

    Flickr:
    http://www.flickr.com/photos/dianalange/sets/72157627657832455/

    Credits:
    Fastblur by Mario Klingemann
    Text by Friedrich Schiller

    # vimeo.com/31203226 Uploaded 16.7K Plays 3 Comments

likes

vivian wang

Browse This Channel

Shout Box

Heads up: the shoutbox will be retiring soon. It’s tired of working, and can’t wait to relax. You can still send a message to the channel owner, though!

Channels are a simple, beautiful way to showcase and watch videos. Browse more Channels.