Page 3 - Data Structures Interactive Book
P. 3

2.2  Big-O Notation ....................................................................................................... 24


                          2.2.1  Common Growth Rates .................................................................................. 25

                          2.2.2  Examples in C++ ............................................................................................ 25


                       2.3  Best, Worst, and Average Case Analysis ............................................................... 25

                          2.3.1  Best Case ......................................................................................................... 25


                          2.3.2  Worst Case ...................................................................................................... 26

                          2.3.3  Average Case .................................................................................................. 26


                       2.4  Summary ................................................................................................................ 26

                       2.5  Exercise .................................................................................................................. 27



                     CHAPTER 3  ARRAYS .................................................................................................... 29

                       3.1  Introduction to Arrays ............................................................................................ 30


                          3.1.1  Definition and Characteristics ........................................................................ 30

                          3.1.2  Declaration and Initialization .......................................................................... 30


                          3.1.3  Memory Representation .................................................................................. 30

                       3.2  Operations on Arrays ............................................................................................. 31


                          3.2.1  Traversal ......................................................................................................... 31

                          3.2.2  Insertion .......................................................................................................... 31


                          3.2.3  Deletion ........................................................................................................... 31

                          3.2.4  Searching ........................................................................................................ 31


                          3.2.5  Sorting ............................................................................................................. 32

                       3.3  Multidimensional Arrays........................................................................................ 32


                          3.3.1  Two-Dimensional Arrays ............................................................................... 32

                          3.3.2  Higher-Dimensional Arrays ............................................................................ 32


                       3.4  Applications of Arrays ........................................................................................... 32






                                                             3
   1   2   3   4   5   6   7   8