• For the following algorithm, explain what it computes, state what the input size for analysis is, state what basic operations should be counted for analyzingit, state exactly how many operations are executed as a function of the input size, and state the efficiency class or classes to which it belongs. The built-inC++ swap function is extremely efficient, and you should count it as performing exactly two basic operations.01 void foo(vector& array)02 {size_t size = array.size();for (size_t pass_indx = 0; pass_indx < size - 1; pass_indx++){size_t min_position = pass_indx;for (size_t compare_indx = pass_indx + 1; compare_indx < size;compare_indx++){if (array.at (compare_indx) < array.at(min_position)){min_position = compare_indx;}}0304050607080910111213141516if (min_position !- pass_indx)17swap (array.at(pass_indx), array.at (min_position));1819}21 }20

The given code is used for sorting an array The algorithm that is used here is called bubble sort,…

Answered: •For the following algorithm, explain…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, complete the following: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times Maximum word count…
DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, include the following to your answer: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times IMPORTANT: -…
DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, include the following to your answer: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times IMPORTANT: -…
DESIGN YOUR OWN SETTING Task: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, include the following to your answer: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times
Java Objective:Design and implement simple matrix manipulation techniques.Details:Your java program should use 2D arrays to implement simple matrix operations.Your program should do the following:• Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order• Print M1 to the console; make sure you format as a matirx• Repeat the previous steps for a second matrix M2• Create a matrix M3 that is the transpose of M1 and print it to the console• Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message.• Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements:• Use a helper method for reading a positive integer using an input validation loop.• Use a helper method for printing…
Python Coding Exercise: Write a function that takes three parameters: a 2-D array arr, a row location i, a column location j and returns a float representing the fraction of neighbors around arr [i,j] # write your function here:def find_frac(arr,i,j):
Algorithm Design & Analysis You are given an array called source, with length n, and a set of m arrays called target, each also with length n. The arrays contain only positive integers. The arrays are unsorted. For any number x, the smallest number in target[x] is guaranteed to be smaller than target[x+1]. All the numbers in target are unique. The following figure illustrates an example of valid source and target arrays for this case, where n=5 and m=6. The smallest number in each array in target is styled with bold and italic. You can quickly see that the smallest number in target[0] is smaller than the smallest number in target[1], the smallest number in target[1] is smaller than the smallest number in target[2], and so on. You can also see that there is no duplicate number within the arrays in target. You are asked to design an algorithm to find if there is an array in b that has the same set of numbers as in a. In the above case, your algorithm should return true, because…
C program Create random array with user-defined size Write the CreateNewArray() function, which creates an array of any size and randomly fills it with integers in the interval [min, max). Function inputs: the size of the array (int), a seed value for the random number generator (int), and the values min and max defining the interval [min, max) (both ints). Function outputs: a pointer to the newly created array of integers. main() is mostly written for you. It reads in all inputs from the user, calls CreateNewArray(), and prints the array's entries. However, you will need to add a statement at the end of main() to free the memory that you allocated in CreateNewArray(). Reminder: If you dynamically allocate any memory, you MUST free that memory before the end of your program. Note: Inside CreateNewArray(), use srand() to seed the random number generator and rand() to generate random integers in the interval [0, RAND_MAX]. Both functions are accessible in stdlib.h.
- onl Answered: Write a progran Answered: Write a program Answered: The results from 1 Blended Asse as.msu.edu.my msu college Blended Assessment System (B I & sity Part E Question 1 Part E Question 2 Part E Question 3 Part E Question 4 Part E Question 5 Part E Quest Question 3 Two-dimensional arrays can be initialized when they are declared. Given: int integer [4] [3] {{3,2,1}, {4,4,2}, {5,3,0}, {1,0,4}}; Write the for loop to: (a) Find the total of row 2 of the array. (b) Find the total of column 1 of the array. (c) Find the total of each individual row. (d) Find the total of each individual column. (e) Initialize column 2 to 0. [25 Mark] Please write your answer below: Source ABC BIUS x, Styles Format Font Size A-A hp liti
In statistics, the mode of a set of values is the value that occurs most often or with the greatest frequency. Write a function that accepts as arguments the following: A) An array of integers B) An integer that indicates the number of elements in the array The function should determine the mode of the array. That is, it should determine which value in the array occurs most often. The mode is the value the function should return. If the array has no mode (none of the values occur more than once), the function should return −1. (Assume the array will always contain non negative values.) Demonstrate your pointer prowess by using pointer notation instead of array notation in this function.
Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…
Complete the following function definition to recursively print the index of a unique value in an array or -1 if the value is not found:1 int getIndex(int *a, int s, int v) {2 if( ) { // if no values are found3 4 }5 if(a[s-1] == v) { // if a value is found6 7 }8 return getIndex( ); // recurse to check next value9 }Hint:Recurse through the array by counting down from size. 1. Complete the one line of code for line 2:2. Write one line of code for line 3:3. Write one line of code for line 6:4. Complete the one line of code for line 8: please send an atom code. not other software

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS