Fast Sorting Algorith 2/2

 BBS: Inland Empire Archive
Date: 10-25-92 (02:14)             Number: 399
From: ALLAN ZACHARY                Refer#: NONE
  To: RYAN WELLMAN                  Recvd: NO  
Subj: Fast Sorting Algorith 2/2      Conf: (2) Quik_Bas
>>> Continued from previous message
          sp = sp + 1
        END IF
        low = i
      END IF
    LOOP WHILE low < hi
    'IF sp > maxsp THEN maxsp = sp
  LOOP WHILE sp <> 1
  'PRINT "MAX SP"; maxsp

 * SLMR 2.1a * Okay, I pulled the pin. Now what? Hey! Where're ya going?

--- WM v2.04/91-0010
 * Origin: FliegWeg BBS - Home of VitaCal - (512) 496-6550 (1:387/403)
Outer Court
Echo Basic Postings

Books at Amazon:

Back to BASIC: The History, Corruption, and Future of the Language

Hackers: Heroes of the Computer Revolution (including Tiny BASIC)

Go to: The Story of the Math Majors, Bridge Players, Engineers, Chess Wizards, Scientists and Iconoclasts who were the Hero Programmers of the Software Revolution

The Advent of the Algorithm: The Idea that Rules the World

Moths in the Machine: The Power and Perils of Programming

Mastering Visual Basic .NET