Data Structures and Algorithms in JavaUsing a unique multimedia format for learning the fundamentals of data structures and algorithms, this conceptually elegant and innovative text incorporates the object-oriented design paradigm with Java as the implementation language. The result is a learning experience that provides the fundamental intuition and analysis of each structure studied. A Web site complete with Java applications and applets accompanies the text. Includes CD-ROM with... The Microsoft Visual J++ programming environment. |
From inside the book
Results 1-3 of 84
Page 20
... example , by hitting the “ back ” button in the Web browser ) . • stop ( ) : This method is called when the applet is stopped , for example , because the applet window is iconified or the Web browser leaves the Web page containing the ...
... example , by hitting the “ back ” button in the Web browser ) . • stop ( ) : This method is called when the applet is stopped , for example , because the applet window is iconified or the Web browser leaves the Web page containing the ...
Page 39
... Example 2.5 : A certain Professor Amongus claims that every number of the form 2 - 1 is a prime , when i is an integer greater than 1. Professor Amongus is wrong . Justification : To prove Professor Amongus is wrong , we need to find a ...
... Example 2.5 : A certain Professor Amongus claims that every number of the form 2 - 1 is a prime , when i is an integer greater than 1. Professor Amongus is wrong . Justification : To prove Professor Amongus is wrong , we need to find a ...
Page 51
... examples of these notations below . Example 2.18 : 3 logn + log logn is $ 2 ( logn ) . Justification : 3logn + log logn > 3 logn , for n > 2 . This example shows that lower order terms are not dominant in establishing lower bounds ...
... examples of these notations below . Example 2.18 : 3 logn + log logn is $ 2 ( logn ) . Justification : 3logn + log logn > 3 logn , for n > 2 . This example shows that lower order terms are not dominant in establishing lower bounds ...
Common terms and phrases
abstract addition algorithm allows analysis applet applications array associated assume binary tree block called chapter child Code Fragment consider constant container data structure defined deletion denote describe determine dictionary directed discuss edges efficient element empty enumeration equal example executed expression external Figure function give given graph heap height illustrate implementation important Input insertion integer interface internal node iteration Java justification locator loop means memory method Note object operations Output path pattern perform position priority queue problem Proposition protected queue random range rank recursive reference remove represent requires root running search tree sequence shown simple single sorting space specific stack stored string Table takes throw traversal variable vertex vertices visited void