jupyter E2 Last Checkpoint: 2 hours ago (autosaved) Logout | Python 3 O File Edit View Insert Cell Kernel Widgets Help Trusted Run Markdown Problem Statement We want to sort a list of numbers using...

Extracted text: jupyter E2 Last Checkpoint: 2 hours ago (autosaved) Logout | Python 3 O File Edit View Insert Cell Kernel Widgets Help Trusted Run Markdown Problem Statement We want to sort a list of numbers using Insertion Sorting algorithm Input: A = (k,\k, e R Vi < n)="" in="" [="" ]:="" #="" write="" your="" implementation="" here="" def="" insertion_sort(a):="" sorts="" list="" of="" numbers="" using="" the="" insertion="" sort="" technique="" it="" takes="" a:="" a="" list="" of="" integers="" to="" be="" sorted="" outputs:="" [-)="" the="" same="" list="" a="" after="" being="" sorted="" trying="" the="" algorithm="" in="" [="" ]:="" #="" use="" some="" inputs="" to="" empirically="" test="" your="" algorithm="" #="" fill="" in="" a="" sample="" input="" to="" test="" your="" algorithm="" a="" -="" ()="" insertion_sort(a)="" print("output:",a="">


Extracted text: jupyter E2 Last Checkpoint: 2 hours ago (autosaved) Logout | Python 3 O File Edit View Insert Cell Kernel Widgets Help Trusted + > Run Markdown Trying the Algorithm In [ ]: # use some inputs to empirically test your algorithm # fill in a sample input to test your algorithm A = [] insertion_sort (A) print("Output:",A ) Growth Curve Empirically, using time measurements, test your algorithm and plot a graph that shows its growth rate when variating the input. Notice, we are interested in the worst-case time. In [ ]: # feel free to import what you want # This line configures # instead of opening a new window for each figure. More about that later. # If you are using an old version of IPython, try using '%pylab inline' instead. %matplotlib inline lib to show figures embedded in the notebook, import matplotlib import matplotlib.pyplot as plt import time