On 30 Aug 2002, Felix Geerinckx wrote: > on Sat, 31 Aug 2002 03:51:39 GMT, [EMAIL PROTECTED] (Sudarshan > Raghavan) wrote: > > > I thought on similar lines too when that thread was on, but I > > convinced myself saying that an unsorted array of 1000 or more > > elements in your code is a poor design to start with :-) > > I beg to differ. From perldoc perldata (my emphasis): > > Normal arrays are *ordered* lists of scalars > indexed by number, starting with 0 and with negative > subscripts counting from the end. > > One of the main features of arrays (compared to hashes) is that you > have full control over the order in which the elements are inserted. > Many algorithms rely on this order (look e.g. at the GD::Graph module).
My statement was far too general, what I should have said was to have a unsorted array of 1000 or more elements when your problem requires finding the max or min of that list is not a good design. -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
