Just wondering how python works with arrays. Here is quick sort algorithm written in Python. Only one line of code:

def qsort(L):
    if L == []: return []
    return qsort([x for x in L[1:] if x< L[0]]) + L[0:1] + qsort([x for x in L[1:] if x>=L[0]])

Just to compare, how it looks in perl:

 #! /usr/bin/perl
 
 use strict;
 
 sub qsort {
     my ($q, $s, $e) = @_;
     my $m = $s-1;
     
     for (my $i = $s; $i < $e; $i++) {
         if ($q->[$i] < $q->[$e]) {
             $m++;
             ($q->[$m], $q->[$i]) = ($q->[$i], $q->[$m]);
         }
     }
     
     $m++;
     ($q->[$m], $q->[$e]) = ($q->[$e], $q->[$m]);
     qsort($q, $s, $m-1) if $s < $m-1;
     qsort($q, $m+1, $e) if $m+1 < $e;
 }
 
 my @data = map { int(rand(10)) } (1 .. 30);
 
 print "@data\n";
 qsort(\@data, 0, $#data);
 print "@data\n";