About Janus Software
Who is Janus?
Janus is the name of an ancient Roman god who had two faces looking into different directions. These faces are symbols for the two sides of a Janus compiled application. The swf side, written in ActionScript and the .exe side, written in a .NET language.
Furthermore the two faces are a symbol for the two main developers behind Janus.
Enjoy Janus!
About the Spaghetti Sort Team
Spaghetti Sort is not only the 'mother' of Janus, the industry-leading Adobe Flash / Flex .NET wrapper. We work with Flash® and Flex® and .NET ourselves.
From simple screensavers to highly integrated RIA's we develop applications according to your needs. Additionally we offer support for already running projects. Contact us for an offer.
Your Spaghetti Sort team.
What's in our name?
Spaghetti Sort is the name of a mathematical sorting algorithm. For simplicity, assume you're sorting a list of natural numbers. The sorting method is illustrated using uncooked rods of spaghetti:
For each number x in the list, obtain a rod of length x. (One practical way of choosing the unit is to let the largest number m in your list correspond to one full rod of spaghetti. In this case, the full rod equals m spaghetti units. To get a rod of length x, simply break a rod in two so that one piece is of length x units; discard the other piece.)
Once you have all your spaghetti rods, take them loosely in your fist and lower them to the table, so that they all stand upright, resting on the table surface. Now, for each rod, lower your other hand from above until it meets with a rod--this one is clearly the longest! Remove this rod and insert it into the front of the (initially empty) output list (or equivalently, place it in the last unused slot of the output array). Repeat until all rods have been removed.
Preparing the n rods of spaghetti takes linear time. There are then n rods to remove so, assuming each contact-and-removal operation takes constant time, the worst-case time complexity of the algorithm is O(n).