Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 22
Page 167
... pivot before the bottom pointer began to move . Thus , if the bottom pointer should reach the top one , assertion 3 will be satisfied . The other process that could ... pivot sort ( the portion of the list below the pivot 4 ALGORITHMS 167.
... pivot before the bottom pointer began to move . Thus , if the bottom pointer should reach the top one , assertion 3 will be satisfied . The other process that could ... pivot sort ( the portion of the list below the pivot 4 ALGORITHMS 167.
Page 170
... pivot but not beyond the bottom pointer , if ( the pointers do not coincide ) then ( interchange the names indicated by the pointers ) ) interchange the pivot entry with the entry indicated by the common pointers , sort ( the portion of ...
... pivot but not beyond the bottom pointer , if ( the pointers do not coincide ) then ( interchange the names indicated by the pointers ) ) interchange the pivot entry with the entry indicated by the common pointers , sort ( the portion of ...
Page 171
... pivot but not beyond the bottom pointer , if ( the pointers do not coincide ) then ( interchange the names indicated by the pointers ) ) interchange the pivot entry with the entry indicated by the common pointers , sort ( the portion of ...
... pivot but not beyond the bottom pointer , if ( the pointers do not coincide ) then ( interchange the names indicated by the pointers ) ) interchange the pivot entry with the entry indicated by the common pointers , sort ( the portion of ...
Contents
Introduction | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
activities actually addition algorithm allow appear application approach assign associated begin binary block called cell Chapter characters collection communication complete consider consists contains contents database described devices discussed employee entry example execution expressed fact field Figure function given identified implemented indicated input insertion instruction involved language linked loop machine machine's major means memory memory cells module move node notation Note object obtain operating system organization original particular pattern perform pivot pointer position problem produce record refers relation represented request result retrieve routine sequence sequential single solution solving sort stack statement step storage stored string structure subprogram Suppose tape task technique terminal translator tree unit write