12-18-2007
the sort command
Im sorry, I've been reading through other threads about the sort command and unfortunately I havent found an article i could understand. What im trying to understand is how sort keys work, and im not even sure if these ARE CALLED sort keys.
I have records in a file named asd
a 6 f brian
b 5 e andrew
c 4 d billy
d 3 c rizaline
e 2 b angelo
f 1 a sally
I run the command.... cat asd|sort +3
The output...
b 5 e andrew
e 2 b angelo
c 4 d billy
a 6 f brian
d 3 c rizaline
f 1 a sally
I can't seem to find how the command "sort +3" sorted it this way. I humbly ask for some enlightenment on this, Im really new to UNIX and I'm pretty much interested to further practice the language. Thanks in advance!
9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Can someone please tell me how to sort a file, based on a particular position within the file?
I have a line sequential file that is 152 bytes per record, in which i need to sort the file based on the numeric data in positions 142-152.
I have done the "man sort" command and see the -k option... (1 Reply)
Discussion started by: rjjenkin
1 Replies
2. UNIX for Dummies Questions & Answers
Hi,
I am going to sort a huge flat file using sort command, this file is about 36 million lines, 179 fields delimitered by Ctrl B (002). eg.
1^B198709.....
17^B200301....
3^B196511....
.....
I want this file being sorted by the first field, the result is like :
1^B198709........ (2 Replies)
Discussion started by: xli
2 Replies
3. UNIX for Dummies Questions & Answers
Hi
IŽd like to get a few explanations about how the sort command works when cascading the options.
cscyabl@comet:(develop)> more file
2:A2
2:A1
5:A2
5:A2
10:A1
cscyabl@comet:(develop)> sort -n -u file
2:A1
5:A2
10:A1
cscyabl@comet:(develop)> sort -u -n file
2:A1
5:A2
10:A1... (8 Replies)
Discussion started by: Indalecio
8 Replies
4. Shell Programming and Scripting
Hi i have a file containing ip addresses and want to sort those IP addresses in the ascending order.
file (match.txt) contents are:
192.168.0.100
192.168.0.16
192.168.0.10
192.168.0.23
192.168.0.2
192.168.0.3
192.168.0.1
192.168.0.222
i tried:
sort -n match.txt
output is :... (3 Replies)
Discussion started by: manmeet
3 Replies
5. Shell Programming and Scripting
Hi to all.
I'm trying to sort this with the Unix command sort.
user1:12345678:3.5:2.5:8:1:2:3
user2:12345679:4.5:3.5:8:1:3:2
user3:12345687:5.5:2.5:6:1:3:2
user4:12345670:5.5:2.5:5:3:2:1
user5:12345671:2.5:5.5:7:2:3:1
I need to get this:
user3:12345687:5.5:2.5:6:1:3:2... (7 Replies)
Discussion started by: daniel.gbaena
7 Replies
6. Homework & Coursework Questions
I have file ipaddress.txt
192.168.1.25
127.3.9.12
192.168.12.1
127.21.2.3
127.92.80.6
192.168.4.5
I want to sort as
127.3.9.12
127.21.2.3
127.92.80.6
192.168.1.25
192.168.12.1
192.168.4.5
So what sort command do I have to use. (1 Reply)
Discussion started by: RiderOnsky
1 Replies
7. Shell Programming and Scripting
Hello Everybody :) !!!. i have question in mind, is it possible to sort a list of hexadecimal numbers using "sort" command? (9 Replies)
Discussion started by: Kesavan
9 Replies
8. Shell Programming and Scripting
I have a file with the following content:-
181268525,0640613864,B,113,22-dec-2011 14:12:08,
181268525,0640613864,C,113,25-dec-2011 14:18:50,
181268525,0640613864,L,113,26-dec-2011 14:07:46,
181268525,0640613864,X,113,01-jan-2012 16:57:45,
181268525,0640613864,X,113,04-jan-2012 14:13:27,... (3 Replies)
Discussion started by: Yoda
3 Replies
9. Shell Programming and Scripting
I have an input like
4.3.6.66
4.3.6.67
4.3.6.70
4.3.6.25
4.3.6.15
4.3.6.54
4.3.6.44
4.3.6.34
4.3.6.24
4.3.6.14
4.3.6.53
4.3.6.43
4.3.6.49
4.3.6.33
4.3.6.52
4.3.6.19
4.3.6.58
4.3.6.42 (5 Replies)
Discussion started by: dnam9917
5 Replies
PSORT(3) BSD Library Functions Manual PSORT(3)
NAME
psort, psort_b, psort_r -- parallel sort functions
SYNOPSIS
#include <stdlib.h>
void
psort(void *base, size_t nel, size_t width, int (*compar)(const void *, const void *));
void
psort_b(void *base, size_t nel, size_t width, int (^compar)(const void *, const void *));
void
psort_r(void *base, size_t nel, size_t width, void *thunk, int (*compar)(void *, const void *, const void *));
DESCRIPTION
The psort(), psort_b(), and psort_r() functions are parallel sort routines that are drop-in compatible with the corresponding qsort() func-
tion (see qsort(3) for a description of the arguments). On multiprocessor machines, multiple threads may be created to simultaneously per-
form the sort calculations, resulting in an overall faster sort result. Overhead in managing the threads limits the maximum speed improve-
ment to somewhat less that the number of processors available. For example, on a 4-processor machine, a typical sort on a large array might
result in 3.2 times faster sorting than a regular qsort().
RESTRICTIONS
Because of the multi-threaded nature of the sort, the comparison function is expected to perform its own synchronization that might be
required for data physically outside the two objects passed to the comparison function. However, no synchronization is required for the two
object themselves, unless some third party is also accessing those objects.
Additional memory is temporary allocated to deal with the parallel nature of the computation.
Because of the overhead of maintaining multiple threads, the psort() family of routines may choose to just call qsort(3) when there is no
advantage to parallelizing (for example, when the number of objects in the array is too small, or only one processor is available).
Like qsort(3), the sort is not stable.
RETURN VALUES
The psort(), psort_b() and psort_r() functions return no value.
SEE ALSO
qsort(3)
Mac OS X Nov 25, 2008 Mac OS X