Flip 10 and you get 01 then you add 1 to it:
1
01
+ 1
-----
1 1
So, C. 11
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).
It finds a AMOUNT or percentage of a number.
You find this by multiplying or dividing.
Answer:
i) an instruction set, ii) pseudocode
And program in python is:
LENGTH=input("ENTER THE LENGTH OF THE ROOM IN FEET")
BREATH=input("ENTER THE BREATH OF THE ROOM IN FEET")
AREA=int(LENGTH) * int(BREATH)
print("THE AREA OF THE ROOM IN SQUARE YARDS IS", AREA/9)
print("THE CARPET REQUIRED IN SQUARE FEET",AREA)
Explanation:
The pseudo code is:
START
ENTER THE LENGTH OF THE ROOM IN FEET; LENGTH
ENTER THE BREATH OF THE ROOM IN FEET; BREATH
PRINT THE AREA OF THE ROOM IN SQUARE FEET IS; AREA
PRINT THE AREA OF THE ROOM IN SQUARE YARDS IS; AREA/9
PRINT THE CARPET REQUIRED IN SQUARE FEET; AREA
STOP
