COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
time and location
|
|
type and size
|
|
time and memory
|
|
type and space
|
Detailed explanation-1: -Logarithmic Time Complexity-O(log n) Linear Time Complexity-O(n)
Detailed explanation-2: -Two factors which determine the complexity of an algorithm :1 Time Complexity :The amount of computer time algorithm needs to run to completion. 2 Space Complexity :The amount of memory algorithm needs to run to completion.
Detailed explanation-3: -If you are a programmer and want to choose a data structure for your program, consider these factors: The size of the data. The data dynamics, such as changing or editing the data. The speed of data use.
Detailed explanation-4: -Time complexity is a function that describes how long an algorithm takes in terms of the quantity of input it receives. Space complexity is a function that describes how much memory (space) an algorithm requires to the quantity of input to the method.