Here's a ruby example

alphas = [9, 4, 3, 2, 22,  13, 7,  140, 95, 278]
betas  = [8, 3, 4, 1, 278, 94, 15, 7,   19, 200]
result = (alphas & betas).sort
[download]

There's a quite a few other ways to do it too, but I liked that one the most.

Update: Noticing a somewhat lack of variety in the languages used here's a python example too

alphas = [9, 4, 3, 2, 22,  13, 7,  140, 95, 278]
betas  = [8, 3, 4, 1, 278, 94, 15, 7,   19, 200]
result = []
for x in alphas:
    if x in betas:
        result.append(x)

result.sort()
[download]

This is probably the more obvious path, but if you like your tools functional ...

result = filter(lambda y: y != 0, [x in betas and x for x in alphas])
result.sort()
[download]

The closest I can get in perl is this (map == list comprehension?)

@result = sort { $a <=> $b }
          map  { my $x = $_; grep $x == $_, @betas } @alphas;
[download]

HTH

_________
broquaint

update: added python examples
update2: added perl version of last python example