lecture code viewer
downloads
Code
Hashes and Sorting
Hashes and Sorting
Martin Krzywinski
#!/usr/local/bin/perl
$\= "\n";
use Data::Dumper;
@nums = (1..20);
@nums = sort { rand(3)-1 } @nums;
print Dumper(\@nums);
for (1..10) {
push @random_numbers, rand();
}
for $i ( 0..@random_numbers-1 ) {
print qq(index $i value $random_numbers[$i]);
}
for $i ( sort { $random_numbers[$a] <=> $random_numbers[$b] } (0..@random_numbers-1) ) {
print qq(index $i value $random_numbers[$i]);
}
|
4 |
Hashes and Sorting |
1.0.1.8.4
1.0.1.8.4.p1 |
Hashes and Sorting
|
Martin Krzywinski
|
ppt
1.0.1.8.4.c1 |
sequences
|
Martin Krzywinski
|
code
1.0.1.8.4.c2 |
sort
|
Martin Krzywinski
|
code
1.0.1.8.4.a1 |
Hashes and Sorting
|
Martin Krzywinski
|
pdf
1.0.1.8.4.a2 |
Hashes and Sorting
|
Martin Krzywinski
|
pdf
1.0.1.8.4.s1 |
Hashes and Sorting
|
Martin Krzywinski
|
slides
|