. . Some information and suggestions about this quiz Please do not rush through while reading these instructions. Read and make sure you understand them well. To save yourself time moving up and down this notebook, preferably save this notebook as an HTML or PDF, and keep the specifications part of this notebook in a separate window so that you can more easily refer to those specifications as you are planning and developing your program. If you believe you can work more efficiently, say, with a powerful text editor such as GVIM, consider developing and testing your solution with such a tool first. It would then be quite easy to copy and paste your solution from a regular text file into this notebook. This is purely a choice on your part, but I find that I can work faster with GVIM then I can with a notebook, since the notebook does not provide VIM-mode editing, which helps immensely. Keep only a few browser windows and possibly the textbook PDF open on your machine to lower the risk of your computer crashing unexpectedly. Hopefully running less number of programs on your machine will lead to a much lower risk of an unexpected crash, which invariably happens when one loads one's computer with lots of programs running at the same time. Since you will be using the %%file magic directive to store your program in an output file, you may wish to or need to frequently reset the Python environment while working within this notebook, especially to run tests right after modifying your program. To reset, either choose Kernel > Restart or Restart > Run All options from the Jupyter Notebook menu. Alternatively, you can press [Esc] followed by 0 (two zeros) typed back to back on your keyboard. A dialog window will pop in which you can simply press [Enter] to resume your work. If you do not reset the environment by restarting the kernel with one of these options, your modifications will not immediately be reloaded into the test case cells. If your modifications seem not to take effect, this would be the main reason. Remove all # YOUR CODE HERE raise Not ImplementedError() . Using the same iterative approach as that used to merge two sorted lists, complete/fix the implementation of the following function named intersection () for computing the intersection between two given ascending order sorted sequences, seq_a and seq_b such that the worst case performance of the function is O(n). You should not just consider adding new code. The code provided to you below may even have mistakes in it that you can eliminate by removing code. So do not feel limited to only adding code on top of what you have been provided in the code cell below. Do whatever you must to complete and/or fix this code! Do not remove the directive %%file intersection.py from the top of the following cell. . Do not use recursion. You must use loopingliteration to solve this problem. Do not import any external modules. . . Start by cleaning out the extra comments and pass statements %%file intersection.py def intersection( seq_a, seq_b ): BEBE Returns the elements that are common in the given two lists a = 1 b = 1 # YOUR CODE HERE raise Not ImplementedError() while a
