Given code that reads user IDs (until -1), complete the quicksort() and partition() functions to sort the IDs in ascending order using the Quicksort algorithm. Increment the global variable num_calls in quicksort() to keep track of how many times quicksort() is called. The given code outputs num_calls followed by the sorted IDs.Ex: If the input is:kaylasimmsjulia myron1994kaylajones-1the output is:7juliakaylajoneskaylasimmsmyron1994I am having issues getting the count correct. What should I be looking at to adjust the count? 7brownelizajamessusanjonesstevesmithamysmythjune9brownelizajamessusanjonesstevesmithamysmythjune 1 # Global variable2 num_calls = 03 # TODO: Write the partitioning algorithm - pick the middle element as thepivot, compare the values using two index variables 1 and h (low and high),initialized to the left and right sides of the current elements being sorted,and determine if a swap is necessary45 #6 #7 def partition (user_ids, i, k):low = (i-1)mid = (i + k) //2pivot = user_ids[mid]user_ids[mid], user_ids[k] = user_ids[k], user_ids[mid]for j in range (i ,k):if user_ids[j] <= pivot:891011121314low = low + 115user_ids[low],user_ids[j] = user_ids[j],user_ids[low]user_ids[low+1],user_ids[k] = user_ids[k],user_ids[low+1]return ( loW+1 )161718 # TODO: Write the quicksort algorithm that recursively sorts the low andhigh partitions. Add 1 to num_calls each time quisksort() is called19 #20 def quicksort(user_ids, i, k):global num_callsnum_calls = num_calls + 1if ikk:pivot_index = partition(user_ids,i,k)quicksort (user_ids, i, pivot_index-1)quicksort (user_ids, pivot_index+1, k)21222324252627 ifmain ":nameuser_ids = []user_id = input()while user id != "-1":user_ids.append(user_id)user_id = input ()# Initial call to quicksortquicksort (user_ids, 0, len(user_ids) - 1)# Print number of calls to quicksortprint(num_calls)|28293031323334353637# Print sorted user idsfor user id in user ids:print (user_id)383940

Answered: Given code that reads user IDs (until…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Given code that reads user IDs (until -1), complete the quicksort() and partition() functions to sort the IDs in ascending order using the Quicksort algorithm. Increment the global variable num_calls in quicksort() to keep track of how many times quicksort() is called. The given code outputs num_calls followed by the sorted IDs.

Ex: If the input is:

kaylasimms

julia myron1994

kaylajones

-1

the output is:

julia

kaylajones

kaylasimms

myron1994

I am having issues getting the count correct. What should I be looking at to adjust the count?