1. Write a Java program that • Define an integer array with a length of 10. • Populate the array with random integer numbers. • Sort this array into non-decreasing/decreasing order based on three sorting algorithms.         #bubble sort         #selection sort         #Insertion sort • Test these 3 sorting methods • Give a big-Oh characterization, in terms of n, of the running time of these three algorithms. • Improve the bubble sort so that the time complexity of them are O(N) for the best case

Q: Exercise 1: Pre-sorting Consider the problem of finding the distance between the two closest numbers…

A: solution

Q: Java Insertion Sort but make it read the data 12, 11, 13, 5, 6 from a file not an array   // Java…

A: Please find the answer below :

Q: Given an array of size N consisting of only 0's and 1's. The array is sorted in such a manner that…

A: #include <bits/stdc++.h>using namespace std;  // } Driver Code Ends//User function template…

Q: You want to design an algorithm, called minMax(A,p,r), that takes an array of integers and indexes…

A: It is mention that our algorithm should be non-recursive and with time complexity of Θ(n). Our…

Q: Assume we implemented quick sort as we learned in the course, where the pivot is always chosen as…

A: QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given…

Q: List the resulting array after each iteration of the outer loop of the selection sort algorithm.…

A: Initially, the array is C Q R B P D X The outer loop iterates for all indices in array     We find…

Q: Explain (in English) the algorithm for insertion sort.

A: Insertion sort=> Insertion sort is one of the sorting algorithm which we use to sort the array (…

Q: Write a bubble sorting algorithm that sorts a 10-element array called sortarray from smallest to…

A: Bubble sort Algorithm Bubble sort works on the repeatedly swapping of adjacent elements until they…

Q: What is the time complexity for the following code/program?   1.5 A binary search works like this:…

A: A binary search tree is an advanced algorithm used to analyze a node, its left and right branches,…

Q: 2 Write a Java program to find maximum and minimum elements in an array using recursion.

A: In this question we need to write a Java recursive program which prints maximum and minimum elements…

Q: Consider the following algorithm, which may be called on an array that is not necessarily sorted.…

A: T(n) = 3T(⅔n) + 1; T(0)=0, T(1)=0, T(2) = 1

Q: Write a Java program that: • Defines a string array with a length of 15. • Populates the array with…

A: Merge Sort:Divide the array into two halves.Recursively apply Merge Sort to each half.Merge the two…

Q: Write a Java program to sort an ar integers using St non-negative Algorithm.

A: -->The Stooge Sort algorithm is a recursive sorting method. --->It's not the very  effective…

Q: Given an integer array nums sorted in non-decreasing order, return an array of the squares of each…

A: Here is the python code of the above problem. See below steps for code.

Q: Write a C program that gets a positive integer number, n, from the user, and generates n positive…

A: I have provided  C  CODE  along  with  CODE  SCREENSHOT  and  OUTPUT  SCREENSHOT-----------------

Q: Code two versions of Quicksort algorithms, one using the Lomuto method and one using the Hoare…

A: QuickSort is an algorithm that follows Divide and Conquer approach. It choose an element to be pivot…

Q: ef sorting(x, i, j) if j+1-i < 10 then  Mergesort(x, i, j); t1 = i + (j+1-i)/3 t2 = i +…

A: Time complexity: worst case is also same O(n log n) The list of size array is N is divided into a…

Q: Quicksort is a powerful divide-and-conquer sorting algorithm that can be described in just four…

A: Quick sort algorithm- counting the number C(n) of comparisons performed to be sorting an array of…