solve using c++ Consider an array of 10 integers (7,6,8,11,13,12,9,4,2,21). Draw this array after two iteration of shell sort by mentioning steps in a tabular form. You have to explain each step-in detail. Explain how defining gap variable help us in reducing the cost of an algorithm?

solve using c++ Consider an array of 10 integers (7,6,8,11,13,12,9,4,2,21). Draw this array after two iteration of shell sort by mentioning steps in a tabular form. You have to explain each step-in detail. Explain how defining gap variable help us in reducing the cost of an algorithm?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Related questions

Q: A 2D matrix can be represented as a list and a column count value in Python. For example, the 3x3…

A: Tuple in python is to store multiple values within a single variable. The tuple are unchangeable,…

Q: 4. Array1[2] = {5,10}; Write a C program to add 5 for each element in Array1? Explain your answer…

A: #include <stdio.h>int main(){int Array1[2] = {5,10};int sum=0;for(int i=0;i<2;i++){ // Here…

Q: Write a C++ program to copy the elements of an array into another by replacing every element with…

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

Q: For the problems given below, determine whether it is more efficient to use a divide and conquer…

A: memFib(n) { if (mem[n] is undefined) if (n < 2) result = n else result =…

Q: IN C++ You have given an array aa of length n and an integer x to a brand new robot. What the robot…

A: Don't exactly add 'X' elements, instead keep the count of how many elements we are adding to the…

Q: Implement the Tic-Tac-Toe game in C++ using functions and 2D array of 3X3 size. Rules of the Game a)…

A: Tic Tac Toe is a two-player game where one player chooses "X" and another player chooses "O". There…

Q: ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21] ARRAY[] = [11, 21, 33, 40, 50]

A: Given java ARRAY[] = [50, 11, 33, 21, 40, 50, 40, 40, 21] ARRAY[] = [11, 21, 33, 40, 50] ATTN…

Q: Write a c++ program to declare an array of odd number of elements. Split it into the middle and…

A: #include <iostream> #include<math.h> using namespace std; int main() { int…

Q: Write a program using c# to do the following: Initialize an array A with 10 elements. Initialize an…

A: Structured exception handling is supported in C#, as it is in C++. You write code surrounded by…

Q: Question: Using Python In this problem Sereja is interested in the number of arrays of integers, A4,…

A: Here is the detailed and simplified python code for the above listed problem statement:

Q: Can you help me with this program In C++ For the matrix shown in the Figure, write a function…

A: Please give positive ratings for my efforts. Thanks. ANSWER #include<iostream>using…

Q: Write a C++ program that removes all duplicates from the vector sorted in non-decreasing order. The…

A: C++ program to remove duplicate element in the array vector

Q: Write a C++ program to find the only element which is present only once in the given array. In the…

A: Write a C++ program to find the only element which is present only once in the given array. In the…

Q: write a c program for this: A run is a sequence of adjacent repeated values. Compute the length of…

A: Program description: n is the user input integer variable that stores the size of the user input…

Q: use c++ by Using dynamic arrays, implement a polynomial class with polynomial addition, subtraction,…

A: Code is given below #include <iostream> #include <cmath> #include <cstdlib>…

Q: solve using c++ language Consider an array of 10 integers (7,6,8,11,13,12,9,4,2,21). Draw this…

A: Consider an array of 10 integers (7,6,8,11,13,12,9,4,2,21). Draw this array afterthe two iterations…

Q: write a C++ program that removes all duplicates from the vector sorted in non-decreasing order. The…

A: Given:

Q: write a c++ program Take an unsorted array from the user and value of n, find if there exists a…

A: Program Approach: Including a necessary header file Defining the method FindPair Sort the given…

Q: Write a C++ program to update every array element by multiplication of next and previous values of a…

A: Code: #include<iostream>using namespace std; void replace_elements(int nums[], int n){ if…

Q: Write a C++ program for any array to answer the following: int V[3] = {20, 30, -30}; Print out…

Q: Give an example of a C++ code snippet that performs some operation on an array (e.g. sort, search,…

A: #include <bits/stdc++.h> using namespace std; int main() { int A[] = {…

Q: Write a C++ program to update every array element by multiplication of next andprevious values of a…

A: I give the code in C++ along with output and code screenshot

Q: write a c++ program that randomly generate a 20 X20 two-dimensional array, board, of type int. An…

A: Program: //include the required header files #include <iostream> #include <cstdlib>…

Q: Let us consider the problem of reversing the n elements of an array, A, so that the first element…

A: Java Code for above (with main method to test): class Prog{ //function to reverse the…

Q: A Draw the recursion trace for the execution of function ReverseArray(A,0,4) given bel on array A =…

A: Here in this code..(A, 0, 4) will be called..id condition will be true..so swap..again (A ,1,3) will…

Q: •For the following algorithm, explain what it computes, state what the input size for analysis is,…

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

Q: Write a C++ program for the following We are given two sorted arrays (all elements are in ascending…

A: // C++ program to merge two sorted arrays#include<iostream> using namespace std; /* Merge…

Q: An array with any number of elements is said to be repeating if any two or more of the elements are…

A: logic:- compare each element with their neighbouring elements , if they are equal immediately…

Q: Implement the Tic-Tac-Toe game in C++ using functions and 2D array of 3X3 size. Rules of the Game…

A: Actually, the given rules for game is: a) The game is to be played between computer and user.b) One…

Q: Can you ask with the python software language? A 2D matrix can be represented as a list and a…

A: In step 2, you will the Python code.In step 3, you can see the sample output.In step 4, you will…

Q: C++ function to implement the binary search for a given key. The input data should be a sorted…

A: Explanation: - The program comprises of multiple functions for working files and random integers.…

Q: Write a C program that can take an array of length n having positive unique numbers. You are…

A: // C function to find highest in arr[] of size n #include <stdio.h> int largest(int arr[], int…

Q: The insertion sort was discussed and the implementation was demonstrated in the sorting lecture. In…

A: Code screenshots :

Q: c) Using a counting method or otherwise, show that the number of array accesses of the 3-sum…

A: Suppose there are a total of N elements in the array, so try to find the number of array access of…

Q: Q1. Consider a scenario where we have an array with 50 elements. Now suppose we want to look out for…

A: #include<bits/stdc++.h> using namespace std; // To represent a data point corresponding to x…

Q: First, write a Java method merge that takes as parameter a non-empty double array representing…

A: In this question, we are asked to complete readArray(), merge() and printArray() methods in Java…

Q: Give solution in C ++ Language Task 1 Write a C++ program that takes string array of any size and…

A: NOTE: HI, ACCORDING TO POLICY WE ARE ONLY ALLOWED TO SOLVE ONE QUESTION IN ONE POST. PLEASE POST…

Q: The overall goal of this C program is to: 1. Read in a list of integers from standard input and…

A: CODE:- #include <stdio.h>#include <stdlib.h> void arrayCopy(int fromArray[], int…

Q: Write a java program to arrange elements in array X [1,99,70,75,100, -2, -4] in decreasing order…

A: Generally, programs are used to perform certain tasks according to the instructions given by the…

Q: Write a program which will read the elements of a sparse matrix from the keyboard and stores in a…

A: Program that read the elements of a sparse matrix in triplet #include<stdio.h> int main() {…

Q: Write a C++ program that declares an array alphabet of 4 rows and 6 columns of type char, Then: 1)…

A: Given:

Q: C++ Program

A: Program: //include necessary header files #include <iostream> using namespace std; // Get…

Q: program is given below attachment

A: a. The returned value of fib(5) will be: 0 1 1 2 3 b. Recurrence relation for T(n): T(n - 1) + T(n -…

Q: ou have an array of 10,000 subject scores for a high-school exam and you want to find the scores…

A: SUMMARY: -Hence, we discussed all the points.

Q: Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number…

A: So a) Iterate the array and check if a[i] == i^2 or not

Q: Write a C++ program that removes all duplicates from the vector sorted in non-decreasing order. The…

A: The code below is in c++:

Q: Write a C++ program and implement the following: Create a vector of integers and insert 1000 random…

A: QMeasure execution time of 2 sorting algorithms

Q: Can you answer with the Python programming language without using input ? A 2D matrix can be…

A: #function for submatrix def submatrix(matrix,indices): #original matrix in mat mat=matrix[0]…

Concept explainers

Randomized Select Algorithm

A randomized algorithm is defined as one that uses a certain amount of randomization in its logic or operation. It is said to be an algorithm that depends on the random number to perform its operation. It is used for reducing the overall time complexity, space complexity in the standard algorithm. The randomized algorithm uses the concept of random numbers to find the solutions to the different kinds of problems and also to improve the problem solutions.

Question

solve using c++

Consider an array of 10 integers (7,6,8,11,13,12,9,4,2,21). Draw this array after

two iteration of shell sort by mentioning steps in a tabular form. You have

to explain each step-in detail. Explain how defining gap variable help us in reducing

the cost of an algorithm?

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

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

C++ code for shell sort:

Code screenshot:

Output:

Step 5

Step by step

Solved in 5 steps with 3 images

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

The drawback of this approach, is that with each recursive function call, we only reduce the size of the array by one element, and we use a storage space for one activation record. A faster approach is, with each recursive call, reduce the size of the array by 3 elements. a. Write a reduce-and-conquer recursive function FastRecSum()(C++ or python) that find the sum of all float (real) elements in an array of size n. b. Using addition of float (real) values as a basic operation, set up and solve a recurrence relationship to compute the complexity of your code, as a function of the size n of the array.
Write a program using c# to do the following: Initialize an array A with 10 elements. Initialize an array B with 7 elements. Divide each element of array A with each element of array B that is a[0]/b[0] , a[1]/b[1] etc. Implement the same to handle divide by zero error and index out of bound error.
use c++ by Using dynamic arrays, implement a polynomial class with polynomial addition,subtraction, and multiplication. Discussion: A variable in a polynomial does nothing but act as a placeholder forthe coefficients. Hence, the only interesting thing about polynomials is the arrayof coefficients and the corresponding exponent. Think about the polynomialx*x*x + x + 1Where is the term in x*x ? One simple way to implement the polynomial class is touse an array of doubles to store the coefficients. The index of the array is theexponent of the corresponding term. If a term is missing, then it simply has a zerocoefficient.There are techniques for representing polynomials of high degree with many missingterms. These use so-called sparse matrix techniques. Unless you already knowthese techniques, or learn very quickly, do not use these techniques.Provide a default constructor, a copy constructor, and a parameterized constructorthat enables an arbitrary polynomial to be constructed.Supply an…
Consider an array A of N values (N entered by the user). Write a C program that creates a second array B such that the i-th element of B, i.e., B[i] is equal to A[0] *A[1] * A[2] * ... A[i]; In other words:- B[0] = A[0]- B[1] = A[0] * A[1];- B[2] = A[0] * A[1] * A[2];- B[3] = A[0] * A[1] * A[2] * A[3]- ....etc.For this exercise, we would like to implement two solutions and compare their complexity /performance in terms of computation time.Solution 1: Implement blindly the following algorithms: for each element B[i], compute A[0] *A[1] * A[2] * .... *A[i] and save the result in B[i];To test the solution, create an array A of 1000 elements and initialize each of its elements with arandom value (instead of asking the user to . To do that, use the function rand, which, every timecalled, returns a random number Questions:- How long does your program take to produce the solution?- Analyze the solution above and explain why it is taking long time. What are the mainfactors that affect how long…
Given an array A = [10, 7, 4, 2, 1], and target = 7, return the index of the target if found, else return -1. 1. Can this problem be solved in O(logN)? 2. If so, write the implementation. Mention time and space complexity 3. If this problem cannot be solved using O(logN), what is the solution that you suggest - write the code and also mention time and space complexity.
Write a program which will read the elements of a sparse matrix from the keyboard and stores in a two-dimensional array in the form of triplet which saves lots of space. Do the above program in reverse that is triplet is given and your program need to print the corresponding sparse matrix in C language.
Write a C++ program and implement the following: Create a vector of integers and insert 1000 random integers into that. Sort the numbers in the vector in different ways: - With the bubble sort algorithm. - With the quicksort algorithm. Measure the running time for each case - With the quicksort algorithm.
Write a Python function def isSubArray(A,B) which takes two arrays and returns True if the first array is a (contiguous) subarray of the second array, otherwise it returns False. You may solve this problem using recursion or iteration or a mixture of recursion and iteration. For an array to be a subarray of another, it must occur entirely within the other one without other elements in between. For example: [31,7,25] is a subarray of [10,20,26,31,7,25,40,9] [26,31,25,40] is not a subarray of [10,20,26,31,7,25,40,9] A good way of solving this problem is to make use of an auxiliary function that takes two arrays and returns True if the contents of the first array occur at the front of the second array, otherwise it returns False. Then, A is a subarray of B if it occurs at the front of B, or at the front of B[1:], or at the front of B[2:], etc. Note you should not use A == B for arrays.
Using C++ or Java, compare the bubble sort, inclusion sort, and margesort algorithms. Make a large array (as large as 1 million) . After adding random numbers to it, record the time and all of the algorithms, record the time once again, and calculate the effective time. For each method, perform this at least 100 times, then calculate the average execution time.
implement QuickSort of ints that sorts the numbers in the non-decreasing order and in c language Implement the rearrange function used for QuickSort using the O(n) time algorithm with two pointers. The function gets as input an array, and index of the pivot. The function rearranges the array, and returns the index of the pivot after the rearrangement. please write form as: int rearrange(int* A, int n, int pivot_index); 2, Implement the QuickSort algorithm. For n<=2 the algorithm just sorts the (small) array (smaller number first). - For n>=3 the algorithm uses the rearrange function with the pivot chosen to be the median of A[0], A[n/2], A[n-1]. write as form: void quick_sort(int* A, int n);
Write a c++ program to declare an array of odd number of elements. Split it into the middle and store the elements in two different arrays. e.g. Initial array: 22 58 19 87 15 72 9 1 37 After splitting: 22 58 19 87 15 72 9 1 37 As output, your code should print the original and the two split arrays, each element separated by the comma sign. Your code should be generic enough to also work for arrays with an even number of elements.
Write a C program that reads a matrix of n × m numbers, transpose the matrix, then print it out using pointers. (Do not use array subscript syntax such as a[0], a[i])