For each of the following inputs to Insertionsort, state the runtime of the algorithm using (.) notation (no justificati

[answerhappygod]

For Each Of The Following Inputs To Insertionsort State The Runtime Of The Algorithm Using Notation No Justificati 1 (24.4 KiB) Viewed 31 times

For each of the following inputs to Insertionsort, state the runtime of the algorithm using (.) notation (no justification needed; the objective is to sort in increasing order) 1. Integer array A, of length n with Alil-ifor every is n/2 and Al-n-i for every i>n/2. For example, if n-6, then A₁-0, 1.2.3.2.1. Integer array A, of length n with Ali]-4+6 for every 0Sisa-1 2. 3. Integer array As of length n with All-1 for every ie (1-²2-¹3-¹) and All otherwise. We assume that is an integer here. For each question, choose from the following options: 1. (¹) 2. (²) 3. 0(² log¹ n) 4. einlogn/log log a) 5. elog m) 6. e(n) 7. (¹) 8. (2) 9. ²) 10. (*) 11. (² log n) 12. 8(²) 13. (1) 14. 9(n/logn) 15. () 16. (¹) 17. (n/log logn) 18. (nlogn) 19. (nlogn) 20. () 21. (nlog loga)