Mathematics

Mathematics, 15.07.2019 12:00, keirarae2005

How many comparisons are required to merge these pairs of lists using algorithm 10? a.1, 3, 5, 7, 9; 2, 4, 6, 8, 10 b.1, 2, 3, 4, 5; 6, 7, 8, 9, 10 c.1, 5, 6, 7, 8; 2, 3, 4, 9, 10?

answer

Answers: 1

Show answers

Similar questions

Предмет

Computers and Technology, 21.08.2019 03:10, myronpacis1128

Alist of n distinct integers a_1, a_2, a_n is called a mountain list if the elements reading from left to right first increase and then decrease. the location of the peak is the value i where a_i is greatest. for example, the list 1, 2, 3, 7, 6 is a mountain list with a peak at 4. we also consider a list of increasing numbers to be a mountain list with a peak at n, and a list of decreasing numbers to be a mountain list with a peak at 1. give pseudocode for an algorithm based on linear search that takes as input a mountain list a_1, a_2, a_n and returns the location of the peak. show that your algorithm does no more than n - 1 comparisons on any input of size n. give an algorithm based on binary search that takes as input a mountain list a_1, a_2, a_n and returns the location of the peak. your algorithm should be able to find the peak in any list of size 16 with no more than 4 comparisons (in general, up to k comparisons for a list of size 2^k.) you should provide pseudocode and an english description of your algorithm, but you do not need to prove that it meets the requirements for the number of comparisons.

Answers: 2

Предмет

Computers and Technology, 29.08.2019 18:20, dmarte11092001

Design an algorithm to find all the common elements in two sorted lists of numbers. for example, for the lists 2, 5, 5, 5 and 2, 2, 3, 5, 5, 7, the output should be 2, 5, 5. what is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are m and n, respectively?

Answers: 2

Предмет

Computers and Technology, 21.09.2019 03:30, naomirice24

Suppose we want to find the 2nd largest and 2nd smallest elements simultaneously for an input of n numbers stored in an array a[1: n]. compare the following strategies in terms of their exact number of comparisons. strategy 1: adapt the two separate for loops idea for minimum and maximum. strategy 2: run mergesort to sort the numbers in ascending or descending order, then output the 2nd ranked and (n-1)th ranked elements. first write each algorithm in pseudocde, then analyze the exact number of comparisons required by the algorithm. note, asymptotic calculations will only get you partial credit for this problem. can you find a better strategy for this problem than the two given? if yes, write the algorithm and analyze the exact number of comparisons required by the algorithm. if not, prove that one of the given strategies is optimal.

Answers: 2

Предмет

Engineering, 30.10.2019 01:31, skyhighozzie

You are given two lists, one ofmboys and one ofngirls. you are also givenwhether a pair of a boy and girl likes to play together or not. you are asked to find if you can find exactlykpairs of boys and girls that like to play together. give an algorithm to determine if you can make exactlykpairs. if it is possible, your algorithm should determine the pairs and run ino(kc)time, wherecis thenumber of compatible pairs. (you are guaranteed thatkis less than or equal to bothmandn)

Answers: 3

Do you know the correct answer?

How many comparisons are required to merge these pairs of lists using algorithm 10? a.1, 3, 5, 7, 9...

Questions in other subjects:

Konu

Mathematics, 25.02.2021 08:20

Can someone help me find the value of N in the triangle and round the answer to two decimal places

Konu

Mathematics, 25.02.2021 08:20

A 100 g sample of water of has an original temperature of 15.0°C. How much energy is absorbed by the water if the final temperature 24.0°C? The specific heat of water is 4.184 J/g∙...

Konu

Mathematics, 25.02.2021 08:20

Help me plz 2/5 blank = 7/10 plz help...

Konu

Mathematics, 25.02.2021 08:20

Please help, due tonight ...

Konu

English, 25.02.2021 08:20

Write about a type of food that brings back memories for you...

Konu

Computers and Technology, 25.02.2021 08:20

How do you think digital access impacts various areas of cyber security...

Konu

English, 25.02.2021 08:20

Give three examples from the text which support Muhammad Ali’s statement that, “I have always believed in myself.”

Konu

Business, 25.02.2021 08:20

What is the type of economy: traditional-free market - command or mixed. And what is the place in the business cycle: prosperity- recovery- recession or depression

Konu

World Languages, 25.02.2021 08:20

Answer the photo below thanks ...

Konu

Mathematics, 25.02.2021 08:20

I need some help I have a picture attached ...

Other tasks in the category: Mathematics More task