Heap sort pick an item from the first or last position in an array and compares it with other items in other positions in the array, swapping position if they meet the condition.

The array above has three maximum items arranged sequentially in the array, this is prove that there have been 3 reheapifications in the array.

7 0

3 years ago

I need help with username Ideas for the name Jae like Jaestinks or something

Harrizon [31]

Answer: BlueJae or ItsJaeHere I honestly don't know

Explanation:

7 0

3 years ago

Read 2 more answers

What are the most positive and the most negative decimal numbers that can be represented by a 2C (n+k) bit fixed-point number, w

ch4aika [34]

Answer:

The most positive is 3

The most negative is -4

Explanation:

The most positive integer of a number is the smallest positive outcome of such number after simplifying it.

The most negative is the opposite of most positive. Here, the result is negative after simplifying a given function.

See attachment for the step by step solution of the problem.

3 0

3 years ago