Sounds like course/homework or an interview question ;) See Sorting Arrays Without using SORT function or search for similar discussions.

Just writing plz help me is a bit unspecific. You need to explain more in detail, at which point you got stuck.

thnks 4 help.... i need this on urgent basis thats why i wrote this... if u can't reply then there is no need of your comments.

i need this on urgent basis thats why i wrote this... if u can't reply then there is no need of your comments.

If you want a reply, you need to define what's your problem. I assume you are not looking for somebody to write the whole program for you, so presumably you have come to some point, and don't know how to continue from there. But without knowing at which point you are stuck, how could anybody possibly help you?




-- 
Ronald Fischer <ynnor@mm.st>

thnks 4 help.... i need this on urgent basis thats why i wrote this... if u can't reply then there is no need of your comments

Where are you interviewing?

if u can't reply then there is no need of your comments.

Snarky comments like that are no way to engender in the Monks here any sort of desire to help you. I, for one, am offended by your attitude. This is a peer reviewed "forum", for a lack of better word, where the practice of good Perl coding is furthered. It is not your personal help desk.

If you had attempted to solve the problem yourself and posted your code explaining what went wrong you'd get more help than by just saying "I want to write code to predict the stock market out to the year 2115, where do I start?"

For further guidance I'd suggest you read the tutorials at Understanding and Using PerlMoks especially this article. If you follow those guidelines you'll find the Monastery a much friendlier place.

---

Peter L. Berghold -- Unix Professional
Peter -at- Berghold -dot- Net; AOL IM redcowdawg Yahoo IM: blue_cowdawg

Priti24:

This should provide you a couple hints:

$ cat bozosort.pl
#!/usr/bin/perl
use strict;
use warnings;

my @list = (1, 2, 3, 9, 6, 4, 5, 7, 0);

while (@list) {
    my $idx = int rand @list;
    next if grep { $list[$idx] > $_ } @list;
    say splice @list, $idx, 1;
}
[download]

On my machine, this produces:

$ perl bozosort.pl
0
1
2
3
4
5
6
7
9
[download]

You'll want to make appropriate changes to improve performance, use files, etc.

Update: Hung a lantern on it.

...roboticus

When your only tool is a hammer, all problems look like your thumb.

I like stooge sort more. It can be much more efficient: I used functional-programming techniques which means it can be trivially parallelised over many CPUs.

sub stoogesort {
    my (@lst) = @_;

    if ($lst[-1] < $lst[0]) {
        # swap
        @lst[0, -1] = @lst[-1, 0];
    }

    return @lst if (@lst < 3);

    # thirds
    my $zero  = 0;
    my $one   = int(@lst / 3);
    my $two   = int($#lst * 2 / 3);
    my $three = $#lst;

    for my $range (
        [ $zero .. $two   ],
        [ $one  .. $three ],
        [ $zero .. $two   ] ) {
        @lst[ @$range ] = stoogesort( @lst[ @$range ] );
    }

    return @lst;
}

my @list = (1, 2, 3, 9, 6, 4, 5, 7, 0);

print join(" ", stoogesort(@list)), "\n";
[download]

% sort onefile > anotherfile
[download]

Some helpful further reading:

• Inefficient sort algorithms
• Bogosort

Update: use Acme::Sort::Bozo by davido.

Update: A nice visualization

Best regards, Karl

You may view the original node and the consideration vote tally.

You're in luck. If someone were asking me to sort strings, sort would be my second choice too. My first choice would probably be Unicode::Collate. Wrap your solution around that module, and you've satisfied the requirement of not using sort, while at the same time providing a better solution that sort would have offered in the first place.

I'm aware that this answer probably is of little help to you in your interview; the interviewer probably wants to see you write a sort. But if he's interested in getting the job done well, maybe he will respect the answer. ;)