CMSC 132A Lecture Notes - Lecture 38: Linear Search
16 May 2018
School
Department
Course
Professor
CMSC132A Lecture 38: Algorithmic Complexity 2
Now we will talk about the algorithmic performance of different operations.
Constant time
This just means the algorithm requires a fixed amount of time to run that does not
depend on the input size.
And now, for an example.
String inputKey, correctKey;
Boolean isCorrectKey(String inputKey, String outputKey) {
this.inputKey=inputKey;
correctKey=outputKey;
if(!(inputKey.eqauls(outputKey)) {
Throw new Error(“That is incorrect!”);
}
Else {
Return true;
}
}
This block of code runs in constant time because the compiler executes line by line until
it reaches the if block. If the statement is true, the program goes into the block and
returns the error message. If the statement is false, the program skips past the if block
and just returns true. Either way, this is a constant time process. There are only two
Document Summary
Now we will talk about the algorithmic performance of different operations. This just means the algorithm requires a fixed amount of time to run that does not depend on the input size. Boolean iscorrectkey(string inputkey, string outputkey) { this. inputkey=inputkey; correctkey=outputkey; if(! (inputkey. eqauls(outputkey)) { This block of code runs in constant time because the compiler executes line by line until it reaches the if block. If the statement is true, the program goes into the block and returns the error message. If the statement is false, the program skips past the if block and just returns true. Either way, this is a constant time process. There are only two variables at play and you are comparing them. It is not like you are entering variables to compute. Some operations that you need to know that are constant time: This means the algorithm runs with time proportional to the input time.
