Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Design issue

by DentArthurDent (Monk)
on Sep 25, 2003 at 13:13 UTC ( #294151=note: print w/replies, xml ) Need Help??

in reply to Force perl to release memory back to the operating system

I think your problem is one of design. Rather than trying to save all the records and sorting them, just iterate through all of them saving only the ones with the thirty highest balances if all you want to do is find the top clients.

Replies are listed 'Best First'.
Re: Design issue
by paulbort (Hermit) on Sep 25, 2003 at 18:24 UTC
    You missed part of the point: The data sought is the top thirty customers by total, where each customer has multiple transactions. There's no way to know that the last transaction in the file, plus something you've already discarded as inadequate, isn't enough to put a customer back in the top 30.

    The previous suggestions of sorting address this neatly. I was hoping to have something clever to add, but as usual the more prompt monks have covered this one thoroughly.

    Spring: Forces, Coiled Again!

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://294151]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (3)
As of 2017-03-23 04:35 GMT
Find Nodes?
    Voting Booth?
    Should Pluto Get Its Planethood Back?

    Results (281 votes). Check out past polls.