SM0 She11

Path: / / usr / share / awk

Full Path (server): /usr/share/awk

Create Fil3

Upl04d Fil3

• 📄 assert.awk [E] [D]
  [R]
• 📄 bits2str.awk [E] [D]
  [R]
• 📄 cliff_rand.awk [E] [D]
  [R]
• 📄 ctime.awk [E] [D]
  [R]
• 📄 ftrans.awk [E] [D]
  [R]
• 📄 getopt.awk [E] [D]
  [R]
• 📄 gettime.awk [E] [D]
  [R]
• 📄 group.awk [E] [D]
  [R]
• 📄 join.awk [E] [D]
  [R]
• 📄 libintl.awk [E] [D]
  [R]
• 📄 noassign.awk [E] [D]
  [R]
• 📄 ord.awk [E] [D]
  [R]
• 📄 passwd.awk [E] [D]
  [R]
• 📄 quicksort.awk [E] [D]
  [R]
• 📄 readable.awk [E] [D]
  [R]
• 📄 rewind.awk [E] [D]
  [R]
• 📄 round.awk [E] [D]
  [R]
• 📄 strtonum.awk [E] [D]
  [R]
• 📄 walkarray.awk [E] [D]
  [R]
• 📄 zerofile.awk [E] [D]
  [R]

Editing: quicksort.awk

# quicksort.awk --- Quicksort algorithm, with user-supplied # comparison function # # Arnold Robbins, arnoldskeeve.com, Public Domain # January 2009 # quicksort --- C.A.R. Hoare's quick sort algorithm. See Wikipedia # or almost any algorithms or computer science text # # Adapted from K&R-II, page 110 function quicksort(data, left, right, less_than, i, last) { if (left >= right) # do nothing if array contains fewer return # than two elements quicksort_swap(data, left, int((left + right) / 2)) last = left for (i = left + 1; i <= right; i++) if (@less_than(data[i], data[left])) quicksort_swap(data, ++last, i) quicksort_swap(data, left, last) quicksort(data, left, last - 1, less_than) quicksort(data, last + 1, right, less_than) } # quicksort_swap --- helper function for quicksort, should really be inline function quicksort_swap(data, i, j, temp) { temp = data[i] data[i] = data[j] data[j] = temp }
Save