Answer: The shell sort is based on insertion sort. Here the list of elements are divided into smaller sub list which are sorted based on insertion sort.

Its best case time complexity is O(n* logn) and worst case is O(n* log^2 n)

Explanation:

Shell sort is an inplace sorting here we begin by dividing the list into sublist and sorting the list with insertion sort. We create interval for dividing the list into sub list until we reach the smallest interval of 1.

The best case is O(n* logn).

6 0

3 years ago

Name three situations when a copy constructor executes.

Vesna [10]

Answer:

1. When an object of the class is passed (to a function) by value as an argument.

2. When an object is constructed based on another object of the same class.

3. When compiler generates a temporary object.

Explanation:

7 0

3 years ago

Help plsssssssssssssssssssss

antiseptic1488 [7]

I’m pretty sure C or A

7 0

3 years ago

Consider the method total below.

evablogger [386]

That code, if it even compiles, won't produce those values with that call.

5 0

3 years ago

Read 2 more answers