Sponsored Content
Full Discussion: sort in perl
Top Forums Shell Programming and Scripting sort in perl Post 302295016 by otheus on Friday 6th of March 2009 10:21:24 AM
Old 03-06-2009
Not terribly easy.
First, for uniqueness:
Code:
my $prev;
@uniq_array=grep { if (defined $prev && $_ eq $prev) { 0; } else { $prev=$_; 1; } } @sort_array;

Second, build yourself a little sort function:
Code:
sub sort_special { 
  @a=split(":",$a);
  @b=split(":",$b);
  $a[0] cmp $b[0] || $a[1] <=> $b[1];
}

@sort_array=sort sort_special @uniq_array;

 

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Sort file in perl

Hi, I have an entry file for a perl script from which I need to remove duplicate entry. For example: one:two:three one:four:five two:one:three must become : one:two:three two:one:three The duplicate entry is only the first field. I try many options of sort system command but don't... (4 Replies)
Discussion started by: annececile
4 Replies

2. Shell Programming and Scripting

sort and uniq in perl

Does anyone have a quick and dirty way of performing a sort and uniq in perl? How an array with data like: this is bkupArr BOLADVICE_VN this is bkupArr MLT6800PROD2A this is bkupArr MLT6800PROD2A this is bkupArr BOLADVICE_VN_7YR this is bkupArr MLT6800PROD2A I want to sort it... (4 Replies)
Discussion started by: reggiej
4 Replies

3. Shell Programming and Scripting

sort function in perl

Hi, here is my perl script.This script creates an array and is sorting it using the in-built sort function in perl. #!/usr/local/bin/perl my number=6; my @num_arr=(1,2,3,4,5); my @array=(23,"$number","Hello",2.345,@num_arr); #printing the array print... (2 Replies)
Discussion started by: DILEEP410
2 Replies

4. Shell Programming and Scripting

Sort and Unique in Perl

Hi, May I know, if a pipe separated File is large, what is the best method to calculate the unique row count of 3rd column and get a list of unique value of the 3rdcolum? Thanks in advance! (20 Replies)
Discussion started by: deepakwins
20 Replies

5. Shell Programming and Scripting

perl sort

Hi all, Say i have a array @array=("abc,"a",ab"); I would like to sort them according to the length. Any idea? thanks in advanced. i tried below code, but not work. sub sort_fun{ if (length shift(@_) >= length shift(@_) ){ return 1; } else{ return 0; } } (1 Reply)
Discussion started by: summer_cherry
1 Replies

6. Shell Programming and Scripting

how to do sort in perl?

Hi, Can anyone advise how to correct my script pls? I'm not getting the correct output =( Details below: Logfile ======== Player Num : 14 Player Name : Jacee Thirkins MVP winner : 1998 End of details.... Player Num : 35 Player Name : Lander Diaz MVP winner : 2002... (1 Reply)
Discussion started by: gholdbhurg
1 Replies

7. UNIX for Advanced & Expert Users

Perl Sort

I am getting the problem to sort these input in perl. INPUT ------ Eddie-3 Michael-1 Nica-4 Montoya-6 Then the program should print the output as follows: OUTPUT ------- Michael-1 Eddie-3 Nica-4 Montoya-6 I am only able to sort to the words but I want to sort to numbers.. My... (5 Replies)
Discussion started by: mr_harish80
5 Replies

8. Shell Programming and Scripting

sort - perl

Hi, can I sort the fields on the basis of dates in the following format? from this Dec 17 2007 2:18:18:000PM Dec 17 2007 5:18:18:000AM Jan 19 2009 4:30:02:000AM Mar 21 2010 9:13:55:000AM Dec 16 2007 4:29:21:000PM Dec 24 2009 12:29:23:000PM to Dec 16 2007 4:29:21:000PM... (2 Replies)
Discussion started by: shellwell
2 Replies

9. Shell Programming and Scripting

perl hash sort

I have a hash as below 'C1' => { 'x' => 41.9 , 'y' => 5.79999999999995} 'c2 288' => { 'x' => 428.05 , 'y' => 5.79999999999995} 'turn' => { 'x' => 493.25 , 'y' => 209.85} '0001' => { 'x' => 530.1 , 'y' => 195.7} '000001' => { 'x' => 235.25 , 'y' => 728.15} 'XYZ' => { 'x' => 56.65 , 'y' =>... (6 Replies)
Discussion started by: chakrapani
6 Replies

10. Shell Programming and Scripting

Need help in sort variable in perl

Hi, I need help in sorting variables in perl i have two variables and if those two variables are equal then its good. I have a problem here example: variable1= number2 number1 variable2=number1 number2 in my case above both the variables are also equal but the condition is not... (5 Replies)
Discussion started by: rocky1954
5 Replies
sort(3pm)						 Perl Programmers Reference Guide						 sort(3pm)

NAME
sort - perl pragma to control sort() behaviour SYNOPSIS
use sort 'stable'; # guarantee stability use sort '_quicksort'; # use a quicksort algorithm use sort '_mergesort'; # use a mergesort algorithm use sort 'defaults'; # revert to default behavior no sort 'stable'; # stability not important use sort '_qsort'; # alias for quicksort my $current = sort::current(); # identify prevailing algorithm DESCRIPTION
With the "sort" pragma you can control the behaviour of the builtin "sort()" function. In Perl versions 5.6 and earlier the quicksort algorithm was used to implement "sort()", but in Perl 5.8 a mergesort algorithm was also made available, mainly to guarantee worst case O(N log N) behaviour: the worst case of quicksort is O(N**2). In Perl 5.8 and later, quick- sort defends against quadratic behaviour by shuffling large arrays before sorting. A stable sort means that for records that compare equal, the original input ordering is preserved. Mergesort is stable, quicksort is not. Stability will matter only if elements that compare equal can be distinguished in some other way. That means that simple numerical and lexical sorts do not profit from stability, since equal elements are indistinguishable. However, with a comparison such as { substr($a, 0, 3) cmp substr($b, 0, 3) } stability might matter because elements that compare equal on the first 3 characters may be distinguished based on subsequent characters. In Perl 5.8 and later, quicksort can be stabilized, but doing so will add overhead, so it should only be done if it matters. The best algorithm depends on many things. On average, mergesort does fewer comparisons than quicksort, so it may be better when compli- cated comparison routines are used. Mergesort also takes advantage of pre-existing order, so it would be favored for using "sort()" to merge several sorted arrays. On the other hand, quicksort is often faster for small arrays, and on arrays of a few distinct values, repeated many times. You can force the choice of algorithm with this pragma, but this feels heavy-handed, so the subpragmas beginning with a "_" may not persist beyond Perl 5.8. The default algorithm is mergesort, which will be stable even if you do not explicitly demand it. But the stability of the default sort is a side-effect that could change in later versions. If stability is important, be sure to say so with a use sort 'stable'; The "no sort" pragma doesn't forbid what follows, it just leaves the choice open. Thus, after no sort qw(_mergesort stable); a mergesort, which happens to be stable, will be employed anyway. Note that no sort "_quicksort"; no sort "_mergesort"; have exactly the same effect, leaving the choice of sort algorithm open. CAVEATS
This pragma is not lexically scoped: its effect is global to the program it appears in. That means the following will probably not do what you expect, because both pragmas take effect at compile time, before either "sort()" happens. { use sort "_quicksort"; print sort::current . " "; @a = sort @b; } { use sort "stable"; print sort::current . " "; @c = sort @d; } # prints: # quicksort stable # quicksort stable You can achieve the effect you probably wanted by using "eval()" to defer the pragmas until run time. Use the quoted argument form of "eval()", not the BLOCK form, as in eval { use sort "_quicksort" }; # WRONG or the effect will still be at compile time. Reset to default options before selecting other subpragmas (in case somebody carelessly left them on) and after sorting, as a courtesy to others. { eval 'use sort qw(defaults _quicksort)'; # force quicksort eval 'no sort "stable"'; # stability not wanted print sort::current . " "; @a = sort @b; eval 'use sort "defaults"'; # clean up, for others } { eval 'use sort qw(defaults stable)'; # force stability print sort::current . " "; @c = sort @d; eval 'use sort "defaults"'; # clean up, for others } # prints: # quicksort # stable Scoping for this pragma may change in future versions. perl v5.8.0 2002-06-01 sort(3pm)
All times are GMT -4. The time now is 12:41 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy