Use quicksortto sort the above list into alphabetical order ii) Use the binary search algorithm to locate the name Luke

Nearest polygonal number def nearest_polygonal_number(n, s): Any positive integer s > 2 defines an infinite sequence of s-gonal numbers whose i:th element is given by the formula ((s-2)i^2 - (s-4)i)/2, as explained on the Wikipedia page "Polygonal Number". In this formula, positions start from 1, not 0, and we use the letter i to denote the position since we will be using the letter n for something else. For example, the sequence of "octagonal numbers" that springs forth from s = 8 starts with 1, 8, 21, 40, 65, 96, 133, 176... Given the number of sides s and an arbitrary integer n, this function should return the s-gonal integer closest to n. If n falls exactly halfway between two s-gonal numbers, return the smaller one. n s Expected result 5 3 6 27 4 25 450 9 474 10**10 42 9999861561 10**100 91 10000000000000000000000000000000000000000000000000416332753518329478897755794704334003003544212420356

=' =Trace bucket sort algorithm as it sorts the array into an ascending order. ASSUMPTION: (1) Use four buckets that have the ranges specified as follows: %3D [0,25), [25,50), [50,75), and [75,100), respectively (2) Show (or explain) the steps as detail as possible. If needed, please illustrate the steps. A =[ 78 17 39 26 72 94 21 12 68 ] 29

Algorithms' kings Determine how long it takes the algorithm to perform a binary search. Please offer specific instructions.

q1i )   Arrange the data in ascending order using the Radix sorting method, for the data below: 925. 254, 196, 373, 369, 482, 512, 738, 695, 158.                                       Note: Show all the steps in how the sorting method is applied.     (Data structures and algorithm)

Q1:- Sort the text “SUIT PESHAWAR” in ascending order using the insertion sort algorithm. Discuss also the best, worst and average case complexity of the algorithm.

Selection sort Insertion sort Shell sort   Can someone show and explain how each one of these sorting methods work? (Mainly use arrays if possible).

This is not a graded question so please don't disregard it as if it is. Thank you in advance professor!

Rankings of Algorithms Find out how much time is required for the algorithm to complete a binary search. Please provide explicit guidance.

Data: 45,30,50,25,60,55,75,70 From the data, do the sorting using 1. Selection sort method 2. Insertion sort method