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:
3/8
Explanation:
Because 2 can't go into 7, the next best thing is 6, so 2x3 is 6 with 1/8 left over~~~~~hope this helps :) pls brainlist
Cobol and python it's some other let me think
Answer:
Nelson proposed a system where copying and linking any text excerpt, image or form was possible.
Explanation:
Ted Nelson is one of the theoretical pioneers of the world wide web who is best known for inventing the concept of hypertext and hypermedia in the 1960s. As one of the early theorists on how a networked world would work.
How I know:
I goggle it.
