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).
Answer:
1. Counting in this circle and square system is similar to how we count in our regular lives because it obeys agreed-upon rules
2. On the other hand, counting in this circle and the square system is different to how we count in our regular lives because it utilizes shapes instead of numbers
Explanation:
Circle Square Pattern of counting is a form of counting that is similar to the binary structure but has distinct rules for sorting shapes. It involves the development of all possible messages with three-place values, with other distinct created rules that illustrate how it sorted each message.
Hence, in this case, the correct answers are:
1. Counting in this circle and square system is similar to how we count in our regular lives because it obeys agreed-upon rules
2. On the other hand, counting in this circle and the square system is different to how we count in our regular lives because it utilizes shapes instead of numbers
Answer:
Cloud computing is Internet-based computing where shared resources, software, and information are provided to devices and computers on demand. (pay-for-what-you-use model)
ex. servers, storage, databases, networking, software, analytics, and intelligence
