Create a digit rearrangement function for each numerical item in a list based on ascending or descending order. Examples [155, reorderDigits ([515, 341, 98, 44, 211], "asc") 134, 89, 44, 112] reorderDigits ([515, 341, 98, 44, 211], "desc") [551, 431, 98, 44, 211] reorderDigits ([63251, 78221], "asc") [12356, 12278]

Create a digit rearrangement function for each numerical item in a list based on ascending or descending order. Examples [155, reorderDigits ([515, 341, 98, 44, 211], "asc") 134, 89, 44, 112] reorderDigits ([515, 341, 98, 44, 211], "desc") [551, 431, 98, 44, 211] reorderDigits ([63251, 78221], "asc") [12356, 12278]

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

Similar questions

TODO 5 List and indexing practice. Create a list containing all even numbers up to and including 100. Store the list in a variable called even_list. Try using Pythons range() function (docs)and then casting it as a list using list(). Check the length of the even_list. Store the output into the even_list_length variable. Use list indexing to return the last 5 elements of the even_list. Store the output into last_five_even_elements. Use list indexing to return the second to last element of the even_list. Store the output into second_to_last_even_element. Use list indexing to return the first 10 elements of the even_list. Store the output into first_ten_even_elements. # TODO 5.1 even_list = print(f"even_list output: {even_list}") todo_check([ (even_list == [2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,96,98,100], 'even_list does not match the desired output! Make sure you have even numbers…
Q1. Apply Merge Sort and Quick Sort to the list, C , 0 , M , P, U,T,E,R in alphabetical order.
Integer num_rows is read from input, representing the number of rows of data remaining in the input. Two-dimensional list vals_2d consists of data read from the remaining input. Output each row of numbers in vals_2d on one line, ending each number with a space.
# Using the routes dictionary defining places your airline can go with #with mileage to each, create a function that determines the total #distance travelled by going to the airports in sequence defined by this # list itinerary and the routes dictionary. (No published answer... def summary (routesMap) : # Please do not change any code below... airports = list (routesMap.keys ()) for airport in airports: destinations = routesMap [airport] for n in range (0,len (destinations)): destinationInfo = destinations [n] destination = destinationInfo [0] mileage = destinationInfo [1] print (f"Leaving {airport} to {destination} for (mileage} miles.") def distanceUsing (routesMap, itinerary): milesTravelled = 0 ### Your code goes here. return milesTravelled def main (): # Please do not change this dictionary... routes = { main () "Austin": "Chicago": "Dallas": "Denver": "El Paso": "Houston": "Nashville": summary (routes) [["Chicago", 500], ["Houston", 180], ["Nashville", 86011, [["Austin", 500],…
Python question, need some help
A fibonacci series is defined as a series where the number at the current index, is the value of the summation of the index preceding it (index -1) and (index-2). Essentially, for a list fibonacci_numbers which is the fibonacci numbers series, fibonacci_numbers[i] = fibonacci_numbers[i-1] + fibonacci_numbers[i-2] The fibonacci series always begins with 0, and then a 1 follows. So an example for fibonacci series up to the first 7 values would be - 0, 1, 1, 2, 3, 5, 8, 13 Complete the fibonacci(n) function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Important Note Use recursion and DO NOT use any loops. Review the Week 9 class recording to see a variation of this solution. def fibonacci(n): if (n < 0 ): return -1 else: return n fibonacci_numbers = (fibonacci[n - 1] + fibonacci[n - 2]) return fibonacci_numbers(n) # TODO: Write…
Question in image Please explain how to do with the answer. Thank you.
I have a computer science question Given list: ( 5, 8, 16, 25, 43, 48, 54, 59, 69, 78, 81, 96 ) Which list elements will be compared to key 43 using binary search? Enter elements in the order checked.
In python don't import libraries
Please answer the ques
Write a function called list_to_dict(lst) that takes a 2-D list of sales records of this form.[["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75]]Your function will store the sales information in a dictionary, where each {key:value} pair of the dictionary stores {a unique customer: [ a list of all products purchased by this customer, total cost of these products]}, and returns the dictionary. Sample run,sales = [ ["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75],["customer2", "milk", 4.35], ["customer3", "egg", 3.6], ["customer4", "bread", 4.5],["customer1", "milk", 4.35], ["customer2", "egg", 3.6], ["customer4", "milk", 4.35] ]>>> record = list_to_dict(sales)>>> display(record)customer1 : [['bread', 'egg', 'milk'], 16.1]customer2 : [['bread', 'milk', 'egg'], 12.45]customer3 : [['egg'], 3.6]customer4 : [['bread', 'milk'], 8.85]
7. display a value at a specified index in a linked chain of integers For example, display the 3rd element in the chain, display the 10th element in the chain, etc. a.O(log n) b.O(n2) c.O(n) d.O(1) e.none of these is correct