
3. Please order the following functions by growth rate: (2 marks) n, n, ni .5, n. n log n. 3/n, n log log n. 2″. 6, n3 4. What is the complexity of the following algorithm? (2 marks) int getHandshakes(int n) int handshakes 0; for (int i- 0; i< n; i++) for (int j = i+1 ; j 〈 n; j++){ handshakes++ COMP SCI 2103 & 7103 Algorithm
PayPal Gateway not configured
PayPal Gateway not configured