By using binary search algorithm, search for $250$ in the list

$10,12,25,55,150,167,230,249,250,280,300.$

Determine the number of comparisons.

Use the buble sort to put $5,3,7,4,1,6,2$ into increasing order. Determine the number of passes and the

number of interchanges and comparisons in each pass.

Use the insertion sort to put $5,3,7,4,1,6,2$ into increasing order. Determine the number of interchanges

and comparisons.

Consider the following $6$ activities sorted by finish time:

Assuming a single person can only work in a single activity, determine the maximum number of activities

that can be performed by that person.

Six jobs with following deadlines and profits are given:

Assuming that each job takes a single unit of time, maximize the total profit by finding a maximum profit

sequence of jobs.