Given an pseudo code for(i = 0; i < a. Length; i = i+1){ for(j = 0;
Fantastic news! We've Found the answer you've been seeking!
Question:
Given an pseudo code
for(i = 0; i < a. Length; i = i+1){
for(j = 0; j < a. Length; j = j+1){
if(even){
A[i, j] = 1;
}
}
}
1) what is the time and space complexity in terms of the big-o given that there is X rows and R columns?
2) what is auxiliary space compare to space complexity, you can use the algorithm above to explain.
Related Book For
Introduction to Data Mining
ISBN: 978-0321321367
1st edition
Authors: Pang-Ning Tan, Michael Steinbach, Vipin Kumar
Posted Date: