Question

The * Heapsort algorithm* is based on the
heap data structure.

The algorithm works by:

- repeatedly removing the maximum value, i.e. the element at position 0, from the heap;
- and then restoring the heap property,
- until the heap is empty.

Given the array [73, 57, 0, 47, 8, 9], first turn it into a
Max-Heap, and then into a sorted array in *ascending* order,
using the Heapsort algorithm.

You have to show the array content of the heap, as well as a tree
representation(**) of the heap, at each step(*).

(*) you may consider one step of the Heapsort algorithm to be one
call of the percDown() function as from the Heapsort algorithm
implementation presented in textbook section 7.5, figures
7.8.

Alternatively, you may consider one step of the Heapsort algorithm
to be one call of the removeMax() function as from the Heapsort
*heapify()* implementation at Lecture 10.

Answer #1

Hope this resolves your doubt.

Please give an upvote if you liked my solution. Thank you :)

(Data Structure)
Suppose we want to store the data of
a binary heap in an array. Show the data of that array after
inserting the given keys one by one. Assume that initially binary
heap is empty. Show all steps of insertions.
Note: No need to show the changes for
each step of “percolate up”. The contents of the array must be
shown after completing one insertion.
Create the “Min Heap” for the
following data set
7,
3, 18,
-9, ...

Write code in java
Implement a method to build an AVL tree out of a sorted
(ascending order) array of unique integers, with the
fastest possible big O running time. You may implement private
helper methods as necessary. If your code builds a tree that is
other than an AVL tree, you will not get any credit. If your code
builds an AVL tree, but is not the fastest big O implementation,
you will get at most 12 points. You...

1. Given an
n-element array A, Algorithm X executes an
O(n)-time computation for each even
number in A and an O(log n)-time computation for
each odd number in A.
What is the best-case running time of Algorithm X?
What is the worst-case running time of Algorithm X?
2. Given an array,
A, of n integers, give an O(n)-time algorithm that finds
the longest subarray of A such that all the numbers in that
subarray are in sorted order. Your algorithm...

Task 2: Compare strings. Write a function compare_strings() that
takes pointers to two strings as inputs and compares the character
by character. If the two strings are exactly same it returns 0,
otherwise it returns the difference between the first two
dissimilar characters. You are not allowed to use built-in
functions (other than strlen()) for this task. The function
prototype is given below: int compare_strings(char * str1, char *
str2);
Task 3: Test if a string is subset of another...

Use the following algorithm:
(1) Create three stacks of characters: stk1, stk2, stk3.
(2) Read the input infix expression one character at a time and
push every character read ( other than ')' ) onto stk1. Do not push
the character read if it is ')'.
(3) As long as stk1 is not empty, do the following:
Fetch the top character ( call it c ) of stk1 and pop stk1.
if
c is an alphabetic character (a-z),...

Write a code in c++ using linear insertion following the steps
below. Comment your work.
1. Ask the user for the name of a file containing
data. If it does not exist, the program should display an error,
then ask for a new file name. Entering an asterisk (*) as the first
and only character on a line should terminate the program.
2. You can use a statically-allocated
one-dimensional array of doubles for this with length 100. You...

The following algorithm finds the initial substring of y
that can be reversed and found in y. For example,
longestInitialReverseSubstringLength(“aabaa”) = 5, because “aabaa”
is the same string forwards and backwards, so the longest initial
substring that can be reversed and found in the string is “aabaa”.
Also, longestInitialReverseSubstringLength(“bbbbababbabbbbb”) is 6,
because “babbbb” can be found in the string (see color-highlighted
portions of the string), but no longer initial string exists
reversed in any part of the string.
longestInitialReverseSubstringLength(String
y)...

this is the book name. Data Structures and Abstractions with
Java
1) Description: The sample programs in Chapter 1 of your
textbook are not complete. They are used for illustration purpose
only. The implementation of Listing 1-1 on page 39 is explained in
Chapter 2. And, in order to see the result of using it, we will
need the following set of files:
i. BagInteface.java – the specification only.
ii. ArrayBag.java – the implementation of BagInerface.java.
iii. ArrayBagDemo.java – a...

This laboratory assignment involves implementing a data
structure called a map. A map associates objects called
keys with other objects called values. It is
implemented as a Java class that uses arrays internally.
1. Theory.
A map is a set of key-value pairs. Each key is
said to be associated with its corresponding value, so
there is at most one pair in the set with a given key. You can
perform the following operations on maps.
You can test if...

Description
The word bank system maintains all words in a text file named
words.txt. Each line in the text file stores a word while
all words are kept in an ascending order. You may assume that the
word length is less than 20.
The system should support the following three functions:
Word lookup: to check whether a given word exists in
the word bank.
Word insertion: to insert a new word into the word
bank. No insertion should be made...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 3 minutes ago

asked 29 minutes ago

asked 31 minutes ago

asked 33 minutes ago

asked 33 minutes ago

asked 44 minutes ago

asked 44 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago