Given the contents of a sorted array of size 6, shown below, show which indices of the array will be visited, and in what order, if the algorithm BinarySearch was to be performed on this array for the number 4.
int theArray[] = {1, 2, 3, 6, 8, 9};
Following are example question & answer:
Homework Answers
Binary search algorithm :
- first and last denoting first and last index of array.
- if first > last
- Then return -1.
- Else
- Calculate mid = first+last/2.
- if array[mid] is equal to search element.
- Then return the element index.
- Else if array[mid] greater than search element
- Then call binary search algorithm on first half the array. i.e first = 0 and last value is mid-1.
- Else call binary search algorithm on second half of the array. i.e first = mid+1, and last value = size(array-1).
End .
------------------------
![mid=4 the Array[mid] the Array [4] = 78 78 81 first last midt = 4 4 1=5. last-4 Here first y last 57.4 Ccondition is true) Re](http://img.homeworklib.com/questions/a7d67130-0068-11eb-9b71-0903bfc6fd5e.png?x-oss-process=image/resize,w_560)
![step2) first = 3 last = 5 mid= (3+5)/2 = 8/2 mid =4 the Array [mid] = the Array [4] = 8 8::>4 = first = 3 last mid-1 E4-1 las](http://img.homeworklib.com/questions/a8d670f0-0068-11eb-adad-9f3616a65f4c.png?x-oss-process=image/resize,w_560)
Add Answer to:
Given the contents of a sorted array of size 6, shown below,
show which indices of...
I need to develop the 7 functions below into the main program that's given on top...
I need to develop the 7 functions below into the main program
that's given on top
Write a C program to create array, with random numbers and perform operations show below. Il Project 3 (53-20). 1 Projects CS5,00 This file contains the function Programcution Dagine and one include <timo // Defining some constants definer_SIZE 20 define LOVE LIMIT 1 eine UPR UNIT define TALSE eine Tut 1 wold randomizery (int[], int, Int, int) wold pinay in. St, Int); En find...
3. Modify the insertion sort algorithm discussed in class so that it can sort strings. That...
3. Modify the insertion sort algorithm discussed in class so
that it can sort strings. That is, its input will be an array, the
type of which is string. The insertion sort algorithm will sort the
elements in this array. Finally, its output will be a sorted
array.
As the solution of this problem, you need to submit the
following answer(s): (1). The implementation of your algorithm in
C# (20points).
Algorithm: At each array-position, it checks the value there against...
_______________________________________________________________________________________________ java language-trace instructions". (20 points) Show the contents of the array below, once the contents...
_______________________________________________________________________________________________
java language-trace
instructions". (20 points) Show the contents of the array below, once the contents of the array below, once the "pivot" element is placed at its location after each call of the "Partition” algorithm, in the process of running Quick-Sort on said array. Arrange the data in ascending order (Trom Arrange the data in ascending order (from smallest to largest value). Always select the first element of the partition as "pivot" in data cat B. Apply sorting on...
The ExceptionLab class provided: – Creates an array of 100 elements and fills it with random...
The ExceptionLab class provided: – Creates an array of 100
elements and fills it with random numbers from 1 to 100. – It asks
the user for an index value between 0 and 99. – Prints the element
at that position. – If a number > 99 is entered by the user, the
class will abort with an ArrayIndexOutOfBoundsException • Modify
the ExceptionLab: – Add a try-catch clause which intercepts the
ArrayIndexOutOfBounds and prints the message: Index value cannot be...
JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized...
JAVA question: Suppose we are performing a binary search on a sorted array called numbers initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 int[] numbers = {-30, -9, -6, -4, -2, -1, 0, 2, 4, 10, 12, 17, 22, 30}; // search for the value -5 int index = binarySearch(numbers, -5); Write the indexes of the elements that would be examined by the binary search (the mid values...
Suppose a binary tree data (in tiny written size) is stored in an array (A) as...
Suppose a binary tree data (in tiny written size) is stored in an array (A) as given below and root is placed at “0”index. Note the array indices are in larger written size (0 to 74). Show the traversal data of the given tree for a) In-Order Traversal b) Post Order Traversal A 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 3 28 13 36 15 9 22 44 7 10 75 33 19 15...
sort.c #include <stdlib.h> #include <stdio.h> #include "libsort.h" int main() { int* array; int size,...
sort.c
#include <stdlib.h>
#include <stdio.h>
#include "libsort.h"
int main()
{
int* array;
int size, c;
float median;
printf("Enter the array size:\n");
scanf("%d", &size);
array = (int*) malloc(size *
sizeof(int));
printf("Enter %d integers:\n", size);
for (c = 0; c < size; c++)
scanf("%d",
&array[c]);
sort(array, size);
printf("Array sorted in ascending
order:\n");
for (c = 0; c < size; c++)
printf("%d ",
array[c]);
printf("\n");
median = find_median(array,...
Write a main function that declares the names, marks, number of elements as well as the...
Write a main function that declares the names, marks, number of elements as well as the value to be searched for and the index of the returned function calls. Read and display the contents of names and marks. Ask the user for a name and using the linear search return the index to the user. If -1 is returned then the name is not in the file. Otherwise write out the name and mark for that student. Sort the arrays...
Given a sorted (in ascending order) integer array nums of n elements and a target value,...
Given a sorted (in ascending order) integer array nums of n elements and a target value, write a method to perform a binary search for a target value in nums. If target exists, then return its index, otherwise return -1. Analyze the running time, T(n). public int search(int[] nums, int target) { // YOUR CODE GOES HERE } // end search
23.1 Append to Oversize Array Java Help Given an oversize array with size1 elements and a...
23.1 Append to Oversize Array Java Help Given an oversize array with size1 elements and a second oversize array with size2 elements, write a method that returns the first array with the elements of the second appended to the end. If the capacity of the oversize array is not large enough to append all of the elements, append as many as will fit. Hint: Do not construct a new array. Instead, modify the contents of the oversize array inside the...
I need to develop the 7 functions below into the main program
that's given on top
Write a C program to create array, with random numbers and perform operations show below. Il Project 3 (53-20). 1 Projects CS5,00 This file contains the function Programcution Dagine and one include <timo // Defining some constants definer_SIZE 20 define LOVE LIMIT 1 eine UPR UNIT define TALSE eine Tut 1 wold randomizery (int[], int, Int, int) wold pinay in. St, Int); En find...
3. Modify the insertion sort algorithm discussed in class so
that it can sort strings. That is, its input will be an array, the
type of which is string. The insertion sort algorithm will sort the
elements in this array. Finally, its output will be a sorted
array.
As the solution of this problem, you need to submit the
following answer(s): (1). The implementation of your algorithm in
C# (20points).
Algorithm: At each array-position, it checks the value there against...
_______________________________________________________________________________________________
java language-trace
instructions". (20 points) Show the contents of the array below, once the contents of the array below, once the "pivot" element is placed at its location after each call of the "Partition” algorithm, in the process of running Quick-Sort on said array. Arrange the data in ascending order (Trom Arrange the data in ascending order (from smallest to largest value). Always select the first element of the partition as "pivot" in data cat B. Apply sorting on...
The ExceptionLab class provided: – Creates an array of 100
elements and fills it with random numbers from 1 to 100. – It asks
the user for an index value between 0 and 99. – Prints the element
at that position. – If a number > 99 is entered by the user, the
class will abort with an ArrayIndexOutOfBoundsException • Modify
the ExceptionLab: – Add a try-catch clause which intercepts the
ArrayIndexOutOfBounds and prints the message: Index value cannot be...
sort.c
#include <stdlib.h>
#include <stdio.h>
#include "libsort.h"
int main()
{
int* array;
int size, c;
float median;
printf("Enter the array size:\n");
scanf("%d", &size);
array = (int*) malloc(size *
sizeof(int));
printf("Enter %d integers:\n", size);
for (c = 0; c < size; c++)
scanf("%d",
&array[c]);
sort(array, size);
printf("Array sorted in ascending
order:\n");
for (c = 0; c < size; c++)
printf("%d ",
array[c]);
printf("\n");
median = find_median(array,...
Most questions answered within 3 hours.
-
Enzyme X exhibits maximum activity at pH = 5.25. X shows a sharp
decrease in its...
asked 10 minutes ago -
Postulate a reason for why so many aliphatic amino acids are
essential.
asked 9 minutes ago -
Three samples were taken of 4 different dog food bags and their
weights were recorded:
Sample/Observation...
asked 12 minutes ago -
The Beatles had 27 number one hits; a radio station asks
listeners to send in a...
asked 10 minutes ago -
Help with Java Program Please
Create a simple graph class. The graph class should have the...
asked 11 minutes ago -
Which of the following statements is true regarding the nature
of culture?
A.We are born with...
asked 32 minutes ago -
(a) 2
NO2(g) à 2
NO(g) +
O2(g)
The rate law for this reaction
is 2nd...
asked 35 minutes ago -
Write the overall reaction for the RedOx
reaction (below) when it occurs in an acidic environment....
asked 41 minutes ago -
Two forces are acting on an object. Force 1 on the object is 6.0
N and...
asked 42 minutes ago -
You are planning for retirement. You plan to work for 20 years.
Starting a year from...
asked 56 minutes ago -
The African Adventures exhibit water system holds approximately
850,000 gallons (3.2x109 g) of water. The temperature...
asked 47 minutes ago -
which of the following is capital?
the barn a farmer uses to hold the chickens he...
asked 57 minutes ago