hey,
I have a file that looks smthng like this:
/*--- abcd_0050 ---*/
asdfjk
adsfkja
lkjljgafsd
/*---abcd_0005 ---*/
lkjkljbfkgj
ldfksjgf
dfkgfjb
/*-- abcd_0055--*/
klhfdghd
dflkjgd
jfdg
I would like it to be sorted so that it looks like this:
/*---abcd_0005 ---*/
lkjkljbfkgj (9 Replies)
how can i sort the next list just by look at the numbers (ignore letters)
example:
abc123
dff4f
aaa2aa
bbbb55555bb
output:
aaa2aa
dff4f
abc123
bbbb55555bb (1 Reply)
i have list of files:
Wang De Wong CVPR 09.pdf
Yaacob AFGR 99 Second edition.pdf
Shimon CVPR 01.pdf
Den CCC 97 long one.pdf
Ronald De Bour CSPP 04.pdf
.....
how can i sort this directory so the output will be in the next format:
<year>\t<conference/journal>\t<author list> - t is tab
(its... (1 Reply)
i have list of files:
Wang De Wong CVPR 09.pdf
Yaacob AFGR 99 Second edition.pdf
Shimon CVPR 01.pdf
Den CCC 97 long one.pdf
Ronald De Bour CSPP 04.pdf
.....
how can i sort this directory so the output will be in the next format:
<year>\t<conference/journal>\t<author list> - t is tab
(its... (1 Reply)
Let's say that I have a database that I call part ID. This database has the following grouping:
Dart1=4
Dart2=8
Dart3=12
Fork1=68
Fork2=72
Fork3=64
Bike1=28
Bike2=24
Bike3=20
Car1=44
Car2=40
Car3=36
I want to write a program that would read this database and tell me when the... (19 Replies)
hi everyone, I am kind of new to this forum. I need help in sorting this data out accordingly, I am actually doing a traceroute application and wants my AS path displayed in front of my address like this;
192.168.1.1 AS28513 AS65534 AS5089 AS5089 .... till the last AS number and if possible... (1 Reply)
hi everyone, I am kind of new to this forum. I need help in sorting this data out accordingly, I am actually doing a traceroute application and wants my AS path displayed in front of my address like this;
192.168.1.1 AS28513 AS65534 AS5089 AS5089 .... till the last AS number and if possible... (1 Reply)
Hi, I have posted related topic but as i continue the research I find more need to sort the data.
AS(2607:f278:4101:11:dead:beef:f00f:f), AS786 AS6453 AS7575 AS7922
AS(2607:f2e0:f:1db::16), AS786 AS3257 AS36252
AS786 AS3257 AS36252
AS(2607:f2f8:1700::2), AS786 AS6939 AS25795 ... (6 Replies)
Hi all,
Does anyone can help me the following question? I would like to write an AWK script.
In the following input file, each number in "start" is paired with numbers in column "end".
No Start End
A 22,222,33,22,1233,3232,44 555,333,222,55,1235,3235,66... (7 Replies)
Hi, Please i need help in writing an 'awk' script in sorting the following data;
traceroute6 to 2001:1ba0:2a0:5965:0:30:24:1 (2001:1ba0:2a0:5965:0:30:24:1) from 2001:418:1::62, 64 hops max, 16 byte packets
1 2001:418:1::4 0.342 ms
2 2001:418:1::1 0.630 ms
3 2001:504:16::1b1b 0.393 ms
4... (6 Replies)
Discussion started by: sam127
6 Replies
LEARN ABOUT NETBSD
radixsort
RADIXSORT(3) BSD Library Functions Manual RADIXSORT(3)NAME
radixsort, sradixsort -- radix sort
LIBRARY
Standard C Library (libc, -lc)
SYNOPSIS
#include <limits.h>
#include <stdlib.h>
int
radixsort(const u_char **base, int nmemb, u_char *table, u_int endbyte);
int
sradixsort(const u_char **base, int nmemb, u_char *table, u_int endbyte);
DESCRIPTION
The radixsort() and sradixsort() functions are implementations of radix sort.
These functions sort an nmemb element array of pointers to byte strings, with the initial member of which is referenced by base. The byte
strings may contain any values. End of strings is denoted by character which has same weight as user specified value endbyte. endbyte has
to be between 0 and 255.
Applications may specify a sort order by providing the table argument. If non-NULL, table must reference an array of UCHAR_MAX + 1 bytes
which contains the sort weight of each possible byte value. The end-of-string byte must have a sort weight of 0 or 255 (for sorting in
reverse order). More than one byte may have the same sort weight. The table argument is useful for applications which wish to sort differ-
ent characters equally, for example, providing a table with the same weights for A-Z as for a-z will result in a case-insensitive sort. If
table is NULL, the contents of the array are sorted in ascending order according to the ASCII order of the byte strings they reference and
endbyte has a sorting weight of 0.
The sradixsort() function is stable, that is, if two elements compare as equal, their order in the sorted array is unchanged. The
sradixsort() function uses additional memory sufficient to hold nmemb pointers.
The radixsort() function is not stable, but uses no additional memory.
These functions are variants of most-significant-byte radix sorting; in particular, see D.E. Knuth's Algorithm R and section 5.2.5, exercise
10. They take linear time relative to the number of bytes in the strings.
RETURN VALUES
Upon successful completion 0 is returned. Otherwise, -1 is returned and the global variable errno is set to indicate the error.
ERRORS
[EINVAL] The value of the endbyte element of table is not 0 or 255.
Additionally, the sradixsort() function may fail and set errno for any of the errors specified for the library routine malloc(3).
SEE ALSO sort(1), qsort(3)
Knuth, D.E., "Sorting and Searching", The Art of Computer Programming, Vol. 3, pp. 170-178, 1968.
Paige, R., "Three Partition Refinement Algorithms", SIAM J. Comput., No. 6, Vol. 16, 1987.
McIlroy, P., "Computing Systems", Engineering Radix Sort, Vol. 6:1, pp. 5-27, 1993.
HISTORY
The radixsort() function first appeared in 4.4BSD.
BSD January 27, 1994 BSD