File: demo_heapsort3

package info (click to toggle)
runawk 1.6.1-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 712 kB
  • sloc: awk: 1,127; ansic: 736; sh: 420; makefile: 103
file content (22 lines) | stat: -rwxr-xr-x 380 bytes parent folder | download | duplicates (4) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
 
#!/usr/bin/env runawk

#use "heapsort.awk"

# This demo sorts the input lines as (key, value) pair
# and outputs sorted pairs.

# Input file for this demo: examples/demo_heapsort3.in

{
	val = $2
	val += NR * 0.00001 # for regression tests
	hash [$1] = val
}

END {
	count = heapsort_values(hash, remap)

	for (i=1; i <= count; ++i){
		print remap [i], int(hash [remap [i]])
	}
}