Computers and Technology, 06.09.2019 21:20, axell13965
)given the following algorithm (suppose n can only be even), answer the questions algorithm1(int n, const int s[]) { if (n==2) return; for (int i = 1; i < =n/2; i++) cout< < s[ i ] * s[ i+n/2 ]; } a) what is the output of the algorithm if n = 6, and s[1, 3, 6, 2, 2, 2] b) what is the best case complexity of the algorithm? c) what is the worst case complexity of the algorithm?
Answers: 3
Computers and Technology, 13.07.2019 00:30, Daveandemily17
Answers: 3
Mathematics, 30.07.2019 19:30, LunaSpellman
Answers: 1
Physics, 05.11.2019 23:31, luisgonz5050
Answers: 1
)given the following algorithm (suppose n can only be even), answer the questions algorithm1(int n,...
Social Studies, 26.08.2020 19:01
Mathematics, 26.08.2020 19:01
Computers and Technology, 26.08.2020 19:01