Comments on: AS2 Sorting Algorithms http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/ technology is good Wed, 21 Jan 2009 18:24:24 +0000 http://wordpress.org/?v=2.9 hourly 1 By: Zeus Labs » Blog Archive » Computer Science Concepts in Actionscript http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-58 Zeus Labs » Blog Archive » Computer Science Concepts in Actionscript Fri, 14 Apr 2006 02:08:21 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-58 [...] Several Sorting Algorithms [...] [...] Several Sorting Algorithms [...]

]]> By: Simonin.it - Life is a flash / Algoritmi di ordinamento in AS2 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-31 Simonin.it - Life is a flash / Algoritmi di ordinamento in AS2 Tue, 28 Feb 2006 08:28:52 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-31 [...] Interessante articolo riguardante gli algoritmi di ordinamento (i più famosi) che in questo caso interagiscono con gli elementi di un array (la quale cardinalità è a discrezione dell’utente). Come dice l’autore il QuickSort non ha potuto implementarlo perchè l’albero delle ricorsioni di Flash è piuttosto limitato (se non erro si limita a 256 chiamate ricorsive). [...] [...] Interessante articolo riguardante gli algoritmi di ordinamento (i più famosi) che in questo caso interagiscono con gli elementi di un array (la quale cardinalità è a discrezione dell’utente). Come dice l’autore il QuickSort non ha potuto implementarlo perchè l’albero delle ricorsioni di Flash è piuttosto limitato (se non erro si limita a 256 chiamate ricorsive). [...]

]]> By: Felix Raab http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-21 Felix Raab Mon, 27 Feb 2006 21:31:39 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-21 sorry...the blog software cut off my post...? some illegal chars...? @darron: sounds reansonable that the internal Array.sort method should be faster but some time ago I compared it with a custom quick sort function and if I remember correctly in some cases the quick sort was faster than Array.sort... sorry…the blog software cut off my post…? some illegal chars…?

@darron: sounds reansonable that the internal Array.sort method should be faster but some time ago I compared it with a custom quick sort function and if I remember correctly in some cases the quick sort was faster than Array.sort…

]]> By: Felix Raab http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-19 Felix Raab Mon, 27 Feb 2006 21:29:40 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-19 Hey tim, here's another one you could include in your benchmark: It's called "gnome sort" (http://www.cs.vu.nl/~dick/gnomesort.html). An as version would be something like this: (I'm guessing gnome sort is quite slow compared to the others...?) function gnomeSort(ar:Array):Void { var i:Number = 0; var n:Number = ar.length; var tmp; while (i Hey tim,

here’s another one you could include in your benchmark: It’s called “gnome sort” (http://www.cs.vu.nl/~dick/gnomesort.html). An as version would be something like this: (I’m guessing gnome sort is quite slow compared to the others…?)

function gnomeSort(ar:Array):Void {

var i:Number = 0;
var n:Number = ar.length;
var tmp;

while (i

]]> By: Keith Peters http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-18 Keith Peters Mon, 27 Feb 2006 18:04:49 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-18 I've seen some of those links before and wondered if it would be worth implementing some of the faster methods in AS. Makes sense though, that the built in one would be faster. I’ve seen some of those links before and wondered if it would be worth implementing some of the faster methods in AS. Makes sense though, that the built in one would be faster.

]]> By: Tim http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-17 Tim Mon, 27 Feb 2006 16:07:27 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-17 I started working on a visual sort but hadn't finished it yet. Thanks for the links. I've seen the first one a long time ago. The second one makes it pretty clear what's going on during the sort. I started working on a visual sort but hadn’t finished it yet. Thanks for the links. I’ve seen the first one a long time ago. The second one makes it pretty clear what’s going on during the sort.

]]> By: darron http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-16 darron Mon, 27 Feb 2006 15:59:47 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-16 More important than the implementation details, then, is the understanding of what the sort themselves are doing. Have you had a chance to look at any of the "visual" sort demos on the internet? They show the sort "in progress" to help understand the key differences between the sorts: Here's one: http://www.cs.ubc.ca/spider/harrison/Java/sorting-demo.html Here's another: http://math.hws.edu/TMCM/java/xSortLab/ Why not try making one in Flash to help in your understanding of the sorts as a learning tool? More important than the implementation details, then, is the understanding of what the sort themselves are doing. Have you had a chance to look at any of the “visual” sort demos on the internet? They show the sort “in progress” to help understand the key differences between the sorts:

Here’s one:
http://www.cs.ubc.ca/spider/harrison/Java/sorting-demo.html

Here’s another:
http://math.hws.edu/TMCM/java/xSortLab/

Why not try making one in Flash to help in your understanding of the sorts as a learning tool?

]]> By: Tim http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-15 Tim Mon, 27 Feb 2006 15:14:57 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-15 Thanks for the input. The reason for creating these was mostly out of my own curiosity as to how each would perform in flash. I unfortunately missed this part of intro comp sci being a biology major ;) Thanks for the input. The reason for creating these was mostly out of my own curiosity as to how each would perform in flash. I unfortunately missed this part of intro comp sci being a biology major ;)

]]> By: darron http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/comment-page-1/#comment-14 darron Mon, 27 Feb 2006 15:06:24 +0000 http://www.timwalling.com/2006/02/27/as2-sorting-algorithms/#comment-14 You might be interested in the custom array sort algorithm that I wrote. I tweaked the bin sort to create a very rapid way to sort integers in Flash: http://www.darronschall.com/weblog/archives/000069.cfm In practice, it's probably not a good idea to use the sorts that you mention. These are the classic sorts that are taught in introductory computer science, but they are generally not fast enough, especially in ActionScript. It's probably better to rely on the internal Array sort method because it's the quick sort algorithm and it executes at C++ speed since it's native to the Flash Player. You might be interested in the custom array sort algorithm that I wrote. I tweaked the bin sort to create a very rapid way to sort integers in Flash:

http://www.darronschall.com/weblog/archives/000069.cfm

In practice, it’s probably not a good idea to use the sorts that you mention. These are the classic sorts that are taught in introductory computer science, but they are generally not fast enough, especially in ActionScript. It’s probably better to rely on the internal Array sort method because it’s the quick sort algorithm and it executes at C++ speed since it’s native to the Flash Player.

]]>