Hi List is
000|2008-07-17|556543|RTJ|35-RTGJ|EYT
465|2008-11-10|567789|GHJ|45-DGHH|ETU
533|2008-09-06|567789|GHJ|45-DGHH|ETU
How does it do it?
sort -t ':' +0 -1 -n +1 -2 +2 -3 -o list list
Hi List is
000|2008-07-17|556543|RTJ|35-RTGJ|EYT
465|2008-11-10|567789|GHJ|45-DGHH|ETU
533|2008-09-06|567789|GHJ|45-DGHH|ETU
How does it do it?
sort -t ':' +0 -1 -n +1 -2 +2 -3 -o list list
help with sorting sequence in Unix C:sort -t ':' +0 -1 -n +1 -2 +2 -3 -o list list
Hi List is
000|2008-07-17|556543|RTJ|35-RTGJ|EYT
465|2008-11-10|567789|GHJ|45-DGHH|ETU
533|2008-09-06|567789|GHJ|45-DGHH|ETU
How does it do it?
sort -t ':' +0 -1 -n +1 -2 +2 -3 -o list list
You are using a ':' instead of a bar '|', so the only way it works is by sorting the entire line as a single field, which is handled with +0 -1. The rest of the parameters are essentially unused.
What is your expected output? Show sample input and output data.
Oh comeon ... expected output. This is no Kanitkar's exercises.this is actual development code
So, did my post answer your question or not?
I asked that question because your requirements are not clear at all (atleast not to me) and please refrain from using colloquialisms in your posts.