[ILUG] a sorting puzzle for anybody who's interested

[Ulysees]

one entry per line
my eg that i just did up is

source1
0895556978 20040204115001 00000000000039 35
0895556978 20040204113736 00000000000205 90

source2
0895556978 20040204113725 00000000000210 104
0895556978 20040204114948 00000000000040 106

output
0895556978 20040204115001 00000000000039 35 106
0895556978 20040204113736 00000000000205 90 104

as you can see field1 will always match, but since it is not unique we can't
just match off that.
the combination of field1 and approximations of field2 and 3 can be
considered unique though.
field4 will always vary and is just data that we need to add at the end of
the line as 2 fields.

the length of field1 can vary too but it's match will always be the same
length

uly

----- Original Message ----- 
From: "Vishal Vatsa" <vishal at cs.may.ie>
To: "Ulysees" <Ulysees at ulysees.com>
Sent: Wednesday, February 04, 2004 2:11 AM
Subject: Re: [ILUG] a sorting puzzle for anybody who's interested


> have a look at the attached txt file
> is that like the proper inputs and output
>
> obviously ignore the st* stuff I have put in to explain my self,
> one question is it one entry per line or it is a continuous one line like
I
> have.
>
> I will solve this tomorrow. need sleep at  the moment
>
> -- 
> Vishal Vatsa
> Dept. of Computer Sc.
> NUI Maynooth
>
>
>
>