Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 27
Page 223
An Overview J. Glenn Brookshear. Figure 5-16 The insertion sort in BASIC 100 REM Insertion sort in BASIC . 110 DIM NS ( 10 ) 200 REM Get the names from the terminal . FOR K = 1 TO 10 210 220 INPUT NS ( K ) 230 NEXT K 300 REM Now , sort ...
An Overview J. Glenn Brookshear. Figure 5-16 The insertion sort in BASIC 100 REM Insertion sort in BASIC . 110 DIM NS ( 10 ) 200 REM Get the names from the terminal . FOR K = 1 TO 10 210 220 INPUT NS ( K ) 230 NEXT K 300 REM Now , sort ...
Page 428
An Overview J. Glenn Brookshear. Complexity of the Insertion Sort We begin with the insertion sort ( summarized in Figure 4-11 ) . Recall that the process involved here is to select a list entry , called the pivot , compare this entry to ...
An Overview J. Glenn Brookshear. Complexity of the Insertion Sort We begin with the insertion sort ( summarized in Figure 4-11 ) . Recall that the process involved here is to select a list entry , called the pivot , compare this entry to ...
Page 431
... sort it . In particular , when sorting a list of 10 names we would expect the quick sort to require between 30 and 45 comparisons . ( If you compare this projected performance to that of the insertion sort , you may wonder how the quick ...
... sort it . In particular , when sorting a list of 10 names we would expect the quick sort to require between 30 and 45 comparisons . ( If you compare this projected performance to that of the insertion sort , you may wonder how the quick ...
Other editions - View all
Common terms and phrases
abstract data type activities actually algorithm Alice application application software array assign binary bit patterns block bulk storage called Carol Chapter COBOL concept contains current entry Current Pointer data control block data flow diagram database declare search deleted diagram disk employee example execution Figure FILLED-BY FORTRAN hashed head pointer hexadecimal identify implemented input insertion sort instruction integer linked list loop machine language machine's memory main memory memory cells modified module move notation operating system password perform pivot entry problem produce program counter programming languages pseudocode Questions/Exercises queue record relation represented request result retrieve routines schedule search a failure search a success search tree sequence sequential file solution solving stack statement step storage system stored string subprogram syntax tape target value task technique terminal time-sharing translator Turing machine