Skip to main content
ICT
Lesson AB25 - Order of Algorithms
 
Main Previous Next
Title Page >  
Summary >  
Lesson A1 >  
Lesson A2 >  
Lesson A3 >  
Lesson A4 >  
Lesson A5 >  
Lesson A6 >  
Lesson A7 >  
Lesson A8 >  
Lesson A9 >  
Lesson A10 >  
Lesson A11 >  
Lesson A12 >  
Lesson A13 >  
Lesson A14 >  
Lesson A15 >  
Lesson A16 >  
Lesson A17 >  
Lesson A18 >  
Lesson A19 >  
Lesson A20 >  
Lesson A21 >  
Lesson A22 >  
Lesson AB23 >  
Lesson AB24 >  
Lesson AB25 >  
Lesson AB26 >  
Lesson AB27 >  
Lesson AB28 >  
Lesson AB29 >  
Lesson AB30 >  
Lesson AB31 >  
Lesson AB32 >  
Lesson AB33 >  
Vocabulary >  
 

B. Constant Algorithms, O(1) page 4 of 11

  1. This relationship was not included in the Order of Algorithms graph. Here, the size of the data set does not affect the number of steps this type of algorithm takes. For example:

    public int howBig(ArrayList <Integer> list){
        return list.size();
    }

  2. The number of data items in the array could vary from 0...4000, but this does not affect the howBig algorithm. It will take one step regardless of how big the data set is.

  3. A constant time algorithm could have more than just one step, as long as the number of steps is independent of the size (N) of the data set.

Main Previous Next
Contact
 © ICT 2006, All Rights Reserved.