Challenge26 Summary

Step through the procedure using the given sample array to trace the method. Document your reasoning by writing a blog post that includes a visual representation of the result after each iteration. Once you’ve finished your article, use the pseudocode given to create a functioning, tested version of Insertion Sort.

Whiteboard26 Process

Approach & Efficiency(26)

Time: O(n^2) / Space: O(1) the time because there is two nested loop the space because we assert one item each iterate

Challenge27 Summary

Examine the pseudocode below, then follow the steps using the given example array to trace the method. Document your reasoning by writing a blog post that includes a visual representation of the result after each iteration. Once you’ve finished your article, use the pseudocode given to create a functioning, tested Merge Sort solution.

Whiteboard27 Process

Approach & Efficiency(26)

Tiem : nlogn Space:nlogn

Challenge28 Summary

Examine the pseudocode below, then follow the steps using the given example array to trace the method. Document your reasoning by writing a blog post that includes a visual representation of the result after each iteration. Once you’ve finished your article, use the pseudocode given to create a functioning, tested version of Quick Sort.

Whiteboard28 Process

Approach & Efficiency(26)

explaind in whitboard