Question

• Complete function long_list_printer.print_list(). When it's finished, it should be able to print this list,

  a = [
      [93, 80, 99, 72, 86, 84, 85, 41, 69, 31],
      [15, 37, 58, 59, 98, 40, 63, 84, 87, 15],
      [48, 50, 43, 68, 69, 43, 46, 83, 11, 50],
      [52, 49, 87, 77, 39, 21, 84, 13, 27, 82],
      [64, 49, 12, 42, 24, 54, 43, 69, 62, 44],
      [54, 90, 67, 43, 72, 17, 22, 83, 28, 68],
      [18, 12, 10, 73, 81, 40, 56, 33, 37, 19],
      [81, 72, 88, 92, 76, 21, 25, 20, 23, 58],
      [28, 79, 33, 22, 16, 66, 35, 84, 74, 55],
      [21, 46, 75, 21, 52, 74, 79, 91, 42, 20],
      [63, 37, 67, 48, 14, 91, 47, 87, 83, 34],
      [70, 85, 28, 19, 40, 50, 23, 23, 70, 11],
      [58, 89, 69, 43, 56, 30, 99, 27, 11, 32],
      [70, 34, 33, 41, 49, 47, 72, 92, 45, 29],
      [71, 85, 90, 31, 98, 74, 13, 83, 20, 49],
      [56, 46, 76, 66, 93, 19, 56, 71, 16, 77],
      [12, 22, 71, 71, 90, 44, 97, 18, 51, 29],
      [66, 96, 64, 67, 12, 71, 29, 78, 13, 27],
      [31, 71, 56, 22, 40, 13, 46, 81, 34, 51],
      [83, 10, 26, 56, 34, 24, 51, 65, 27, 70]
  ]

  like this,

  [93, 80, 99, 72, 86, 84, 85, 41, 69, 31]
  [15, 37, 58, 59, 98, 40, 63, 84, 87, 15]
  [48, 50, 43, 68, 69, 43, 46, 83, 11, 50]
  ...
  [21, 46, 75, 21, 52, 74, 79, 91, 42, 20]
  [63, 37, 67, 48, 14, 91, 47, 87, 83, 34]
  [70, 85, 28, 19, 40, 50, 23, 23, 70, 11]
  ...
  [66, 96, 64, 67, 12, 71, 29, 78, 13, 27]
  [31, 71, 56, 22, 40, 13, 46, 81, 34, 51]
  [83, 10, 26, 56, 34, 24, 51, 65, 27, 70]
  

  if called with the arguments a and 3. Note: If your version prints the middle section like this, instead,

  [28, 79, 33, 22, 16, 66, 35, 84, 74, 55]
  [21, 46, 75, 21, 52, 74, 79, 91, 42, 20]
  [63, 37, 67, 48, 14, 91, 47, 87, 83, 34]

  that's fine, too. It probably means that your function is selecting "middle" elements from the list slightly differently from my solution. However, you should adjust the comments in the test code at the bottom of the module to reflect changes in expected output.

  Your completed function must conform to the CISC 121 Programming Style Guide for Python 3.

• Create a dict_bin_search.py module that works with a4.py's code as written. Note: You are not allowed to make changes to a4.py. Your new module should implement a binary search function called search(). Unlike the example shown in lecture, this function need to search lists of dictionaries based on the value of a particular key, so in addition to a list parameter, it will need a parameter for the selected key, and you'll have to make slight adjustments to the code for the function to accommodate the extra parameter.

  Your completed module must conform to the CISC 121 Programming Style Guide for Python 3, and include useful, correctly formatted docstrings and comments.

• Create a dict_quad_sorts.py module that works with a4.py's code as written. Note: You are not allowed to make changes to a4.py. Your new module should implement the quadratic sorts shown in lecture, that is,
  • insertion sort, in a function called insersion_sort()
  • bubble sort, in a function called bubble_sort()
  • optimized bubble sort, in a function called bubble_sort_opt()
  • selection sort, in a function called selection_sort()

  Unlike the examples shown in lecture, these functions need to sort lists of dictionaries based on the values of particular keys, so in addition to a list parameter, they'll need a parameter for the selected key, and you'll have to make slight adjustments to the code for each function to accommodate the extra parameter.

  

  def print_list (a_lit, section_size): "Print entire list a_list if its length is less than or equal to 3 times section_size (an int). Otherwise, print the first section_size elements of a list, followed by an ellipsis ("...") followed by the middle section_size elements, followed by another ellipsis, followed by the final section size elements. Note: This function assumes its parameters' values are valid, and does no exception handling. pass # Replace this instruction with your own code. if ": name == " main # Module testing. # Tests with empty list. a = [] print_list(a, 0) # <no output> print_list (a, 1) # <no output> print list (a, 2) + <no output> # Tests with lists of length <= section size a = ["This", "is", "a", "test"] print_list(a, 0) # No sectioning print() print_list (a, 1) # Three sections, "is" omitted. # ("is" omitted because of way partitioning into sections is done.) print() print_list (a, 2) print() # No sectioning # Test with a longer list. # Here I'm using a technique called list comprehension to generate # a list of integers from 0 ... 99. This is beyond the scope of # CISC 121 (that is, it won't be on a test), but is useful if you # can get to know how it works. a = [i for i in range (100)] print_list(a, 5) # 0...4, "...", 48...52, "...", 95...99 print() print_list(a, 10) # 0...9, "...", 45...54, "...", 90...99 print() print_list(a, 33) # 0...32, "...", 34...66, "...", 67...99 (33 omitted) print() print_list (a, 34) # 0...99 (no sectioning) print() # Test with a list of a length evenly divisible by 3 and a # section size that is 1/3 of that. a = [i for i in range (33)] # a is now length 33. print_list (a, 11) # 0...32 (no sectioning)

• 

• 

Answer 1

Given below is the code for the question. PLEASE MAKE SURE INDENTATION IS EXACTLY AS SHOWN IN IMAGE.
Please do rate the answer if it helped. Thank you.

def print_list(a_list, section_size):
   if len(a_list) <= 3*section_size or section_size == 0:
       for e in a_list:
           print(e)
   else:
       #print first section
       for e in a_list[0:section_size]:
           print(e)
       print('...')
      
       #print mid section
       half = section_size // 2
       start = len(a_list)//2 - half
       end = len(a_list)//2 + half + 1
       for e in a_list[start:end]:
           print(e)
       print('...')
      
       #print last section
       for e in a_list[-section_size:]:
           print(e)

def print_list (a_list, section_size): if len(a_list) <= 3*section_size or section_size =-.0: - > for.e.ina_list: --> > print(e) else: #print.first section for.e in a_list[0:section_size] : > print(e) print('...') #print.mid.section half =.section_size: 1/2 start = len(a_list) //2.-half end = . len(a_list) //2 + half +1 fore in a list[start:end]: > print(e) print('...') #print.last section for ein a_list[-section_size: ] : > S print(e)