Perform a bucket sort on a collection L of equal-length strings. Choose a suitable number of buckets (k) and devise a formula to assign a bucket to each of the strings. Trace the list collection for the specified L and k.

Write a version of the binary search algorithm that can be used to search a list of strings. (Use the selection sort that you designed to sort the list.)

There are two n-element arrays A and B the task is to permute them such that A[i]+b[i]>=k Can someone walk me through the code. I dont understand the iList and jList and why we have if j and i not in List we do List.append. Also at the end why we do if len(iList)+len(jList)==len(A)+len(B) ? def twoArrays (k, A, B): A.sort() B. sort() iList = [] jList = [] for i in range (len (A)): for j in range (len (B)): if(A[i]+B[j]>=k): if j not in jList and i not in iList: iList.append(i) jList.append(j) print (iList) print (jList) if(len (iList) + len(jList) ==len (A) + len(B)) return "YES" else: return "NO"

The bubble sort algorithm shown in this chapter is less efficientthan it could be. If a pass is made through the list without exchanging any elements, this means that the list is sorted and thereis no reason to continue. Modify this algorithm so that it willstop as soon as it recognizes that the list is sorted. Do not use abreak statement

Python Code Create a code that can plot a distance versus time graph by importing matplotlib and appending data from a text file to a list. Follow the algorithm: Import matplotlib. Create two empty lists: Time = [ ] and Distance = [ ] Open text file named Motion.txt (content attached). Append data from Motion.txt such that the first column is placed in Time list and the second column is placed in Distance list. Plot the lists (Distance vs Time Graph). You may use this following link as a source for matplotlib functions:  https://datatofish.com/line-chart-python-matplotlib/  Show Plot.