Perl Tutorial

Fundamentals

Input and Output

Control Flow

Arrays and Lists

Hash

Scalars

Strings

Object Oriented Programming in Perl

Subroutines

Regular Expressions

File Handling

Context Sensitivity

CGI Programming

Misc

Sorting a Hash in Perl

In Perl, a hash is an unordered collection of key-value pairs. Since hashes are inherently unordered, when we talk about sorting a hash, we're typically referring to sorting the keys of the hash and then retrieving the associated values in that order.

Here's a tutorial on sorting hashes in Perl based on various criteria.

1. Basic Hash Sorting (by keys)

By default, the sort function will sort the keys in lexicographical (ASCII-betical) order:

#!/usr/bin/perl
use strict;
use warnings;

my %hash = (
    'apple' => 150,
    'banana' => 100,
    'cherry' => 50,
);

foreach my $key (sort keys %hash) {
    print "$key: $hash{$key}\n";
}

This would output:

apple: 150
banana: 100
cherry: 50

2. Sorting by Hash Values

If you want to sort the hash based on its values, you can do the following:

foreach my $key (sort { $hash{$a} <=> $hash{$b} } keys %hash) {
    print "$key: $hash{$key}\n";
}

This would output:

cherry: 50
banana: 100
apple: 150

3. Sorting by Key Length

To sort by the length of the keys:

foreach my $key (sort { length($a) <=> length($b) || $a cmp $b } keys %hash) {
    print "$key: $hash{$key}\n";
}

Output:

apple: 150
cherry: 50
banana: 100

4. Descending Order

If you want to sort in descending order:

# By value
foreach my $key (sort { $hash{$b} <=> $hash{$a} } keys %hash) {
    print "$key: $hash{$key}\n";
}

# By key
foreach my $key (sort { $b cmp $a } keys %hash) {
    print "$key: $hash{$key}\n";
}

Note:

  • In the sorting subroutines, $a and $b are special package global variables that are set to the keys being compared. They are used only for the sort block or function.
  • The <=> operator is the numerical comparison operator, and cmp is the string comparison operator in Perl.

Conclusion:

Sorting a hash in Perl is typically done by sorting its keys based on different criteria. With the help of anonymous subroutines, the sort function provides a flexible way to define custom sorting behavior.

  1. Perl sort hash by keys example:

    • Description: Sorting a hash by its keys in ascending order.
    • Code Example:
      my %fruit_prices = ('apple' => 2, 'orange' => 1, 'banana' => 3);
my %sorted_fruits = map { $_ => $fruit_prices{$_} } sort keys %fruit_prices;

  2. Sorting a hash by values in Perl:

    • Description: Sorting a hash by its values in ascending order.
    • Code Example:
      my %fruit_prices = ('apple' => 2, 'orange' => 1, 'banana' => 3);
my %sorted_fruits = map { $_ => $fruit_prices{$_} } sort { $fruit_prices{$a} <=> $fruit_prices{$b} } keys %fruit_prices;

  3. How to sort a hash of hashes in Perl:

    • Description: Sorting a hash of hashes based on a specific key.
    • Code Example:
      my %employee_data = (
    'Alice' => { 'age' => 30, 'department' => 'HR' },
    'Bob'   => { 'age' => 25, 'department' => 'IT' },
    'Charlie' => { 'age' => 35, 'department' => 'Finance' }
);

my %sorted_employees = map { $_ => $employee_data{$_} } sort { $employee_data{$a}->{'age'} <=> $employee_data{$b}->{'age'} } keys %employee_data;

  4. Custom sorting of a hash in Perl:

    • Description: Custom sorting based on specific criteria.
    • Code Example (sorting by string length):
      my %words = ('apple' => 'red', 'banana' => 'yellow', 'grape' => 'purple');
my %sorted_words = map { $_ => $words{$_} } sort { length($words{$a}) <=> length($words{$b}) } keys %words;

  5. Sorting a hash numerically in Perl:

    • Description: Numerical sorting of a hash.
    • Code Example:
      my %numeric_data = ('one' => 1, 'three' => 3, 'two' => 2);
my %sorted_numeric = map { $_ => $numeric_data{$_} } sort { $numeric_data{$a} <=> $numeric_data{$b} } keys %numeric_data;

  6. Case-insensitive hash sorting in Perl:

    • Description: Performing a case-insensitive sorting of a hash.
    • Code Example:
      my %case_sensitive = ('apple' => 'red', 'Banana' => 'yellow', 'Grape' => 'purple');
my %case_insensitive = map { $_ => $case_sensitive{$_} } sort { lc($a) cmp lc($b) } keys %case_sensitive;

  7. Perl sort hash by multiple keys:

    • Description: Sorting a hash by multiple keys.
    • Code Example:
      my %multi_key_data = ('apple' => { 'color' => 'red', 'price' => 2 }, 'banana' => { 'color' => 'yellow', 'price' => 1 });
my %sorted_multi_key = map { $_ => $multi_key_data{$_} } sort { $multi_key_data{$a}->{'color'} cmp $multi_key_data{$b}->{'color'} || $multi_key_data{$a}->{'price'} <=> $multi_key_data{$b}->{'price'} } keys %multi_key_data;

  8. Descending order hash sorting in Perl:

    • Description: Sorting a hash in descending order.
    • Code Example:
      my %descending_data = ('apple' => 2, 'banana' => 1, 'orange' => 3);
my %sorted_descending = map { $_ => $descending_data{$_} } sort { $descending_data{$b} <=> $descending_data{$a} } keys %descending_data;

  9. In-place hash sorting in Perl:

    • Description: Modifying the original hash in place.
    • Code Example:
      my %original_data = ('apple' => 2, 'banana' => 1, 'orange' => 3);
my @sorted_keys = sort { $original_data{$a} <=> $original_data{$b} } keys %original_data;
@original_data{@sorted_keys} = @original_data{keys %original_data};
Copyright © devanddep.com | All Rights Reserved