1 votes
0 answers
1
Consider the matrix P whose only Eigen vectors are the multiples of (1 4). Consider the following statementsI. P does not have an inverseII. P has a repeated Eigen value....
0 votes
1 answer
2
Space complexity = input size + extra spaceSo, heap sort also takes input of an 'n' size array.Does this mean that space cost of heap sort algo is O (n).