FIND THE BIG O NOTATION OF THE ALGORITHMS BELOWAlgorithm: TraverseArray (A, u)A:= arrayA)u:= the upper bound of the array, A4StartRepeat step 6 and 7 while (i=locA[i+1]Set i = i-1A[i]%3D9.LOendIf[1Set u= u+1A[loc]Stop12item13

Below is the answer of both the questions

FIND THE BIG O NOTATION OF THE ALGORITHMS BELOVW Algorithm: TraverseArray (A, u) A:= array A) u:= the upper bound of the array, A Start Repeat step 6 and 7 while (i=loc A[i+1] 8. A[i] 9. Set i = i-1 endIf 11 Set u = u+1 A[loc] Stop 12 item %3D 13 1234 S670O

FIND THE BIG O NOTATION OF THE ALGORITHMS BELOVW Algorithm: TraverseArray (A, u) A:= array A) u:= the upper bound of the array, A Start Repeat step 6 and 7 while (i=loc A[i+1] 8. A[i] 9. Set i = i-1 endIf 11 Set u = u+1 A[loc] Stop 12 item %3D 13 1234 S670O

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

Related questions

Q: positions of the first and last zero element in the given array. For example if the array is 3 0 1 0…

A: Q. Compute the distance between the positions of the first and last zero element in the given…

Q: !!!An unsorted array has the property that each element has a distance of at most k positions from…

A: Answer : CODE - PYTHON unsorted_array= [ 4,3,1,5,8,2] #TAKEN SOME RANDOM VALUES IN A LIST ARRAY…

Q: How many comparsions would be needed for insertion sort algorithm for these 3 types of arrays and…

A: Actually insertion sort requires 1/4(N2 - N) comparisons, and thus should require about 1/2 the…

Q: Run above pseudo code of Sorting algorithms of selection sort in C++

A: //Importing library#include<iostream>using namespace std;//swappingvoid swapping(int &a,…

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: Write an algorithm that returns the index of the first item that is less than its predecessor in an…

A: Introduction Write an algorithm that returns the index of the first item that is less than its…

Q: An array is sorted by quick sort. The pivot chosen is 72. What is the position of the pivot after…

A: Ans:) In quicksort, we choose a pivot element and separate the other elements in the list by that…

Q: Let's assume we want to find the largest number in a non-empty array A. A sample solution can be…

A: Let's assume we want to find the largest number in a non-empty array A. A sample solution can be…

Q: Selection Sort The selection sort improves on the bubble sort by making only one exchange for every…

A: In this question we have to understand about the selection sort process for the given list and…

Q: Design an algorithm to find all pairs of integers within an array which sum to a specified value.

A: Let's start with a definition. If we're trying to find a pair of numbers that sums to z, the…

Q: java getDup accepts an array and returns an int. If there is any element is duplicated, the method…

A: Proceeding with the hint, two loops nested should be used to count the duplicate element. Algorithm…

Q: 16. Given an n-element array with n > 100, is it possible to find an algorithm that can find an…

A: Introduction: An algorithm is a step-by-step procedure or set of rules for solving a problem or…

Q: List all the steps used to search for 18 in the sequence 1, 2, 4, 8, 10, 12, 18, 20, 22. Be sure to…

A: In linear search, the elements are compared in sequential manner from left to right and whenever the…

Q: To start, create your own set of 10 numbers in an array that are not sorted. Using your array, do…

A: Merge sort and quick sort of the given array of element in python programing

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: Given the array below, find 30 using the given pseudocode: index 1 3 2 6 3 8 Binary Search…

A: We need to find answers for the given pseudocode.

Q: Algorithm A2: (Selection Sort) SELECTION (A, N) This algorithm sorts the array A with N elements.…

A: General Algorithm Step 1: Repeat Steps 2 to 5 for K = 1 to N-1 Step 2: set temp =…

Q: def create_tree(string): # Initialize the first array with the first letter of the string…

A: The create_tree function is made to parse a string and make the letters and values arrays. These…

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: The following algorithm adds all the entries in the “upper triangular” part of a square n × n array…

A: the best way to do tracing is to put the values and run code line by line to obtain final value.

Q: (4.2) What is the runtime complexity of this algorithm? (4.3) Describe the swap operation (line 4)…

A: Dear Student, The answer to your question is given below -

Q: Given a set of numbers: A = {3, 41, 52, 26, 38, 57, 9, 49}. Use binary-search for finding the…

A: The binary search algorithm to find the search element is works as follows,

Q: Selection sort algorithm is ________, the worst case time complexity of sorting an array containing…

A: Selection sort is a simple sorting algorithm that involves dividing the input array into two parts:…

Q: Finding the Begin Variables i,x: integer, Find: boolean; i=0, Find = false, read:x; //N =number of…

A: In this problem we need to write the code in the python as mentioned in the above question.

Q: an array 19,8,2 copy om last tO first to a second 5-DWORD-element array Note 1: Use the loop as well…

A: doing using 86ASSEMBLY section .text global _start ;must be declared for using gcc…

Q: int [] list = {18,57,8,89,7} and the length = 5 Sort the array using insertion sort algorithm.…

A: Here i am drive and run the given program:…

Q: inversion in an array is a pair of elements that are "out of order," meaning th hat is the…

A: Lets see the solution.

Q: Prime numbers can also be generated by an algorithm known as the Sieve of Eratosthenes

A: Using C++ language

Q: A mode is a value that occurs most often in a list of numbers. Example: the mode of [5, 1, 5, 7, 6,…

A: Both our brute force algorithm and our pre-sorting algorithm will have the following interface…

Q: we want to use the binary search algorithm to find the value 19 in the list. What would be the…

A: Binary Search is a searching technique applied on sorted to list to search for a particular element…

Q: Compute the distance between the positions of the first and last zero element in the given array.…

A: To perform a specific task some set of grammatical rules and vocabulary used for give instruction to…

Q: Searches the specified array of objects using a linear search * algorithm. * * @param data the…

A: Searches the specified array of objects using a linear search:

Concept explainers

Counting sort

The counting sort algorithm sorts an array’s contents by counting the repetition of each element that occurs in the array. A counting sort algorithm is a stable algorithm that works the best when the range of elements in the array is small, say for example from 0 to 9. The count which is the number of repetitions of an element in the array is mapped to an index of an auxiliary array, which is then saved in an auxiliary array. The counting sort algorithm has a stable time complexity of the order of O(size of array + size of auxiliary array). Let’s discuss the algorithm in detail as follows.

Question

FIND THE BIG O NOTATION OF THE ALGORITHMS BELOW
Algorithm: TraverseArray (A, u)
A:= array
A)
u:= the upper bound of the array, A
4
Start
Repeat step 6 and 7 while (i<u)
Print A[i]
7
Set i = i+1
Stop
B)
1
Algorithm: InsertElement(A,u,loc,item)
Start
if A[u] != NULL
Print Array is full
Else
3.
4
6.
Set i = u
Repeat step 8 and 9 while i>=loc
A[i+1]
Set i = i-1
A[i]
%3D
9.
LO
endIf
[1
Set u
= u+1
A[loc]
Stop
12
item
13

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Implement the algorithm in C++. Algorithm: substring (s, p, len) Initialize i = p and count =0 Use an array „dest‟ to hold the required substring Repeat steps 4 ,5 and 6 while count <len dest[count] =s[i] count = count+1 i = i +1 Insert string terminator at end of dest Exit
Select all statements that are true: Select(A,i) returns the i-th order statistic Calling Select(A,n/2) returns the median element if n is odd in O(n) time Select(A,i) returns the i-th element The Select() function can only work on an array of distinct elements Select(A,1) returns the minimum element in A
Java-.Selection and insertion sort 3.a Show steps of selection sort for the given array. You may need to add more rows to the table. Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0 Search 1 . . . end . . . 3.b Show steps of insertion sort for the given array. You may need to add more rows to the table. Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…
In a sequence, numbers decrease up to a point and then increase. Example: A=[10,9,8,7,6,5,13,14,15] Write an algorithm with O(logn) time complexity that finds the smallest element in such an array. (can be pseudocode.)
Computer Science PYTHON Given two inputs, an array of numbers, and a number, return true if number exists in the array and false if it doesn't [6 7 1 2 3 4 5], find => 1 => true find => 8 -> false
The algorithm: –In an array of n elements, go to index [n/2] –If the record there is the one you want, you are done –If the record value there is smaller than your search value, all records less than the current record can be ignored – set your search range of elements to [n/2+1…n] and return to step 1 –Otherwise, set your range of elements to [0…(n/2)-1] and return to step 1 –Repeat this loop until you have 0 elements (record is not found) or record is found Short answer Another approach to the update algorithm is to perform use the delete function for the old value and if it is successful, call the insert function using the new value. Explain in your own words if you think this approach is significantly better, worse, or in the same category as the algorithm discussed in the slides, and why.
Problem 5 Recursive algorithm Design a recursive algorithm called exterma(A, p, r) that finds and returns the ordered pair (min(A[p..r]), max(A[p..r])). Your algorithm should perform exactly [31-2 array comparisons on an input array of length n. Problem 5 [Recursive algorithm] continued on next page... Algorithms CS 460: Assignment 2 Page 2 of 3 Problem 5 1) Write your algorithm in pseudocode. 2) Prove the correctness of your algorithm by induction on m = r-p+1, the length of the subarray A[p..r]. 3) Write a recurrence for the number of comparisons performed on A[1,..n] and show that T(n)= [1-2 is the solution.
How many comparsions would be needed for selection sort algorithm for these 3 types of arrays and all of them has a size of 6. Please provide a calculation. sorted array unsorted array (Answer should be in range) identical array
A majority element is an element that makes up more than half of the items inan array. Given a positive integers array, find the majority element. If there is no majority element,return -1. Do this in O(N) time and 0(1) space.Input: 1 2 5 9 5 9 5 5 5Output: 5
Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.