Homework Answers
12) a. is accomplished with a linear search 13) d. Returns an array with the values from list reversed 14) d. find the smallest value in the array 15) b. the values in the array are reordered smallest to largest
Add Answer to:
QUESTION 12 If an array contains unordered values, searching for a particular value O is accomplished...
Question 10: Given an array of data: array1 10 5 15 2 7 21 Write the...
Question 10: Given an array of data: array1 10 5 15 2 7 21 Write the code for the selection sort to sort the data and draw a table showing how the data is sorted using selection sort. Write the code for Binary search algorithm to find the value 15 from the sorted array. Draw the tree diagram showing the binary search of the list.
Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8...
Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8 9 7 0 4 Pivot selection is defined to be the first element of each sub-list. Show the array before and after each quicksort round (when the array is partitioned after placing the pivot at its correct position). Also, clearly highlight the pivot in each partition b. Consider an unsorted array of integers of size n. Write a Java program to arrange the array...
public class SelectionSorter { //Returns the index of the largest element in the arrayOfIntegers, beginning from...
public class SelectionSorter { //Returns the index of the largest element in the arrayOfIntegers, beginning from the fromIndex. public static Integer[] selectSort(Integer[] incoming) { Integer[] ret = new Integer[incoming.length]; for (int i = 0; i < incoming.length; i++) { ret[i] = incoming[i]; } int temp = 0; for (int i = 0; i < ret.length - 1; i++) { if (ret[i] > ret[i + 1]) {...
JAVA Objectives: 1. Apply linear search algorithm 2. Apply select sort algorithm 3. Apply array iteration...
JAVA Objectives: 1. Apply linear search algorithm 2. Apply select sort algorithm 3. Apply array iteration skill Problem description: Write the following eight methods and write a main function to test these methods // return the index of the first occurrence of key in arr // if key is not found in arra, return -1 public static int linearSearch(int arr[], int key) // sort the arr from least to largest by using select sort algorithm public stati void selectSort(int arr[])...
Programming Assignment #7 (Recursion) This assignment is to write some methods that perform simple array operations...
Programming Assignment #7 (Recursion) This assignment is to write some methods that perform simple array operations recursively. Specifically, you will write the bodies for the recursive methods of the ArrayRecursion class, available on the class web page. No credit will be given if any changes are made to ArrayRecursion.java, other than completing the method bodies Note that the public methods of ArrayRecursion – contains(), getIndexOfSmallest(), and sort() – cannot be recursive because they have no parameters. Each of these methods...
Please answer both questions. Thanks Question 24 (1 point) What value would be returned if the...
Please answer both questions. Thanks
Question 24 (1 point) What value would be returned if the method mystery were called and passed the array values (1, 15, 37, 12) as its parameter? public static int mystery (int[] list) int x = 0; for (int i = 1; i < list.length; i++) { int y = list[i] - list [0]; if (y > x) x = Y } } return x; 29 35 1 36 Question 25 (1 point) What is...
I need the report like this (idea) *Sorting Algorithms: A sorting algorithm is an algorithm that...
I need the report like this (idea) *Sorting Algorithms: A sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other algorithms (such as search and merge algorithms) which require input data to be in sorted lists; it is also often useful for canonical zing data and for producing human-readable output. More formally, the output must satisfy...
The file Sorting.java contains the Sorting class from Listing 9.9 in the text. This class implements...
The file Sorting.java contains the Sorting class from Listing 9.9 in the text. This class implements both the selection sort and the insertion sort algorithms for sorting any array of Comparable objects in ascending order. In this exercise, you will use the Sorting class to sort several different types of objects. 1. The file Numbers.java reads in an array of integers, invokes the selection sort algorithm to sort them, and then prints the sorted array. Save Sorting.java and Numbers.java to...
#include <stdio.h> // Define other functions here to process the filled array: average, max, min, sort,...
#include <stdio.h>
// Define other functions here to process the filled array: average, max, min, sort, search
// Define computeAvg here
// Define findMax here
// Define findMin here
// Define selectionSort here ( copy from zyBooks 11.6.1 )
// Define binarySearch here
int main(void) {
// Declare variables
FILE* inFile = NULL; // File pointer
int singleNum; // Data value read from file
int valuesRead; // Number of data values read in by fscanf
int counter=0; // Counter of...
Java Program Create a class to store an array of with enough space to store 10 integer values. Us...
Java Program Create a class to store an array of with enough space to store 10 integer values. Using the principle of recursion, implement the following: *getSize : returns the size of the array. *get (i): returns the i-th element of the array. If the element does not exist, it throws a "NoSuchElementException” which is a subclass of Java class RunTimeException. *add (val): inserts value as the last element of the array. If necessary, double the size of the current...
Sorting Sort the following array using the quick sort algorithm: (4 Marks) a. 12 26 8 9 7 0 4 Pivot selection is defined to be the first element of each sub-list. Show the array before and after each quicksort round (when the array is partitioned after placing the pivot at its correct position). Also, clearly highlight the pivot in each partition b. Consider an unsorted array of integers of size n. Write a Java program to arrange the array...
Please answer both questions. Thanks
Question 24 (1 point) What value would be returned if the method mystery were called and passed the array values (1, 15, 37, 12) as its parameter? public static int mystery (int[] list) int x = 0; for (int i = 1; i < list.length; i++) { int y = list[i] - list [0]; if (y > x) x = Y } } return x; 29 35 1 36 Question 25 (1 point) What is...
#include <stdio.h>
// Define other functions here to process the filled array: average, max, min, sort, search
// Define computeAvg here
// Define findMax here
// Define findMin here
// Define selectionSort here ( copy from zyBooks 11.6.1 )
// Define binarySearch here
int main(void) {
// Declare variables
FILE* inFile = NULL; // File pointer
int singleNum; // Data value read from file
int valuesRead; // Number of data values read in by fscanf
int counter=0; // Counter of...
Most questions answered within 3 hours.
-
Life requires energy. Use what you know about the energy
transformations that occur in animal cells...
asked 4 seconds ago -
Improving access to medical care has been a challenge in the
U.S. health care system. How...
asked 29 seconds ago -
Engineers must consider the breadths of male heads when
designing helmets. The company researchers have determined...
asked 31 minutes ago -
In the Williamson Ether Synthesis of Phenacetin from
Acetaminophen, sodium methoxide in methanol and 100% ethanol...
asked 35 minutes ago -
If the spin of the earth suddenly changed to spin in the
opposite direction, what effect...
asked 49 minutes ago -
An orb weaver spider with a mass of 0.23 grams hangs vertically
by one of its...
asked 45 minutes ago -
Determine the sample size required to estimate the mean score on
a standardized test within
2...
asked 1 hour ago -
The idea that one can remain relatively 'anonymous' on the
internet if they so choose, for...
asked 54 minutes ago -
In the reaction of N2 and H2 to produce
NH3, how many moles of H2 will...
asked 56 minutes ago -
When a certain coin is flipped, the probability of
obtaining a tails is 0.55. Which of...
asked 53 minutes ago -
Can you show how a sulfonic acid group
is introduced into an aromatic ring by Friedal...
asked 59 minutes ago -
Implement the Smith-Waterman algorithm in C that accepts a
substitution matrix.
You may assume the substitution...
asked 59 minutes ago