1.) Suppose that you sort a large array of integers by using a merge sort. Next you use a binary search to determine whether a given integer occurs in the array. Finally, you display all of the integers in the sorted array.   a.) Which algorithm is faster, in general: the merge sort or the binary search? Explain in terms of Big O notation.   b.) Which algorithm is faster, in general: the binary search or displaying the integers? Explain in terms of Big O notation

Q: a) Consider the following list, which is sorted by quick sort: 18, 40, 16, 82, 64, 67, 57, 50, 37,…

A:

Q: For each of the following situations,name tge best sorting algorithm we studied.(a) the array is…

A: Given: For each of the following situations,name tge best sorting algorithm we studied.(a) the array…

Q: Use C++ Programming language  Write a  function that merges two sorted array-based lists into one…

A: Code:- #include <iostream> //Set up the two arraysvoid mergeArrays(int a[],int b[],int n,int…

Q: 4. Write a program to sort the given list of elements using bubble sort: 33, 55, 11, 99, 22, 88, 77,…

A:

Q: c++ how do I create a program which uses quick sort to sort the following data: 10, 17, 9, 52, 34,…

A: here is your code

Q: Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort…

A: Bubble sort: Bubble sort repeatedly compares and swaps(if needed) adjacent elements in every pass.…

Q: Exercise 1: In this problem, we would like to implement a variation of the Bubble Sort algorithm.…

A: Bubble Sort Algorithm Start the program Call the sort function for given array. Check the element…

Q: 4. Fibonacci and Factorial Merging When two sorted arrays A and B defined as below are merged into…

A: Step 1:   Program Approach:    These are instructions related to the code Include one header file…

Q: Assume nums is a sorted array containing 4000 integers. We want to search for the value -5, but that…

A: Linear Search : When the item is searched in the array with the help of linear search, then the…

Q: How many times does a binary search need to execute to find its value? Recall from our lesson that…

A: Program import java.util.Arrays; public class BinarySearchTest {    static int count;     //main…

Q: Q.1. Implement insertion sort using C++ STL with following constrain and write a program : The…

A: Note- As per the Bartley policy we have to attempt only one question.   Program Explanation- Insert…

Q: Describe how insertion sort works. What would be the running time of insertion sort if all elements…

A: The programming languages provide sorting algorithms in which these can be used to sort an array of…

Q: Suppose we want to sort the array 10, 8, 6, 13, 9, 2, 7, 14, 12, 1, 11 using QUICK SORT, and letting…

A: Given that we want to sort the array 10,8,6,13,9,2,7,14,12,1,11 using quick sort and the last key of…

Q: Write a C++ program to find the number of comparisons using binarySearch and the sequintial search…

A: The, code has given below:

Q: What additional requirement is placed on an array, so that binary search may be used to locate an…

A: a)The array elements must form a heap.

Q: Show how to get the first four sorted numbers when applying Selection sort and Insertion sort. ii)…

A:

Q: a. It was remarked in this chapter that the performance of bubble sort can be improved if we stop…

A: Programming language is missing in the question. So we will answer this program in C++ language. If…

Q: orting Consider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] a.…

A: Actually, array is an collection of elements.

Q: 5. Given two sorted integer lists nums1 and nums2, merge nums2 into nums1 as one sorted array. The…

A: The java answer is

Q: Trace how binary search would find the value 12 in the following array. Remember use multiple lines…

A: Given data is shown below:

Q: Use Compiler of any programming language to create array A= [n] , Generate A randomly as follows,…

A: Program: import java.util.*;import java.lang.*;import java.io.*; class Codechef{ public static void…

Q: Consider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] Write the…

A: Selection sort: Elements in array: [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10]   Pass 1: Find the…

Q: Excute the code in c and upload the same with output in the link provided Inscribe recursive code to…

A: // Binary Search in C #include <stdio.h> int binarySearch(int array[], int x, int low, int…

Q: True or False For each statement below, indicate whether you think it is True or False Because the…

A: Because the update algorithm depends on using linear search, its performance is O(1) in the…

Q: Bubble Sort  - Selection Sort  - Insertion Sort  - Shell Sort  - Merge Sort  - Quick Sort  -…

A: the program is an given below :

Q: code needed for python 3: You are required to investigate the number of comparisons that take place…

A: Step-1: StartStep-2: Declare a list integers [15,  1,  2, 16, 12, 16,  9,  2,  0, 11]Step-3: Print…

Q: You are required to investigate the number of comparisons that take place during the execution of an…

A: Here we have written a c program for insertion sort and written logic for number of comparisons. you…

Q: (1) A shifted sorted array can be defined as follows. Start with a sorted array for example…

A: A sorted array of distinct integers is shifted to the left by an unknown offset and don't have a…

Q: ents of A. What type of sorting is this? Write the algorithm and also mention the name of this…

A: Q: Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array…

Q: Request: Can you please help me with the following? By the way, you don't need to answer the part…

A: Algorithm: Start Initialize array with given numbers Print the array before sorting  Define 3…

Q: 2a_Consider an unsorted array of elements {25, 17, 36, 2, 3, 100, 1, 19, 7}: i) Show how to get the…

A: i) Show how to get the first four sorted numbers when applying Selection sort and Insertion sort. We…

Q: The following code is an implementation of the QuickSort algorithm. The QuickSort algorithm is a…

A: 7 Steps to Debug Efficiently and Effectively 1) Always Reproduce the Bug Before You Start Changing…

Q: 3. Use insert sort and the bubble sort to sort the following lists from smallest to largest: 1, 7,…

A: Answer :

Q: See the pseudo-code of the Binary Search using recursion below. Fill in the XXXX and YYYY in the…

A: An array refers to a simple data storage structure that is capable of holding some given elements of…

Q: 12 - Consider the example of sorting, we implemented Bubble sort but the data started to grow and…

A: We need to use a singleton design pattern to optimize the sorting solution.

Q: Suppose that you sort a large array of integers by using mergesort. Next you use a binary search to…

A: Merge sort & Binary search algorithms: Merge sort: It's type of recursive algorithm. Merge Sort…

Q: Sort Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap…

A: Actually, given information is: Raw data is generated randomly. For different problem size, output…

Q: 4. Insertion Sort • The idea with an insertion sort is that a sorted region grows one item at a…

A: code-  def insertion(arr,key):    j = arr.index(key)-1    while j >= 0 and key < arr[j] :…

Q: Attached Question :

A: Selection sort is a sorting algorithm which is used in writing code in computer science. It is…

Q: 1- Consider the following function : f (n) = 10n + 2n -20 For which positive integer m can you say…

A: Solution:- As, f (n) = 10*n6 + 2*n4 - 20 Thus, for m=6, we can say f (n) is O(nm). Also m = 6 for…

Q: Binary search requires that the data be sorted before it can be applied. If we start with unsorted…

A: Binary search requires array to be sorted before searching an element in the array. By the using…

Q: Implement the most ridiculous quick sort algorithm in the world which uses an insertion sort to…

A: Given:

Q: You are now running the insertion sort algorithm on your computer. Assume that at the start of…

A: You are now running the insertion sort algorithm on your computer. Assume that at the start of…

Q: Take a list of 7 unsorted numbers and apply Insertion Sort Technique to sort the

A: Actually, sorted is a arrange the elements in order.

Q: Juestion which of the following statements about mergesort are true? Unless otherwise specified,…

A: Merge sort is an efficient sorting algorithm which is based on divide and conquer rule. Here is the…

Q: You are first tasked with developing a search algorithm to search for a student by their ID in an…

A: Code for ternary search using recursive search:   //Searching for Student Id in the Students list.…

Q: Write a code to sort the following arrays using selection sort method. [10, 34, 2, 56,7,67, 88, 42]

A:

Q: Write C++ program, you will work on inserting, searching and how many comparisons are needed for…

A: Step 1 : Start Step 2 : Define a function countingNumOfComparison() which takes the dictionary and…

Q: Question # 02:  Let’s assume we want to find the largest number in a non-empty array A. A sample…

A: As per our guidelines we are supposed to answer only one question. Kindly repost the remaining…

Q: Below is how the arrays are represented ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21] Here length…

A: Solution Source code of the java "main.java" public class Main {        public static void…