#This is a way without a loop
friends = list(map(str,input("Enter Names: ").split()))
print(sorted(friends))
#This is a way with a loop (for&&while)
friends = list(map(str,input("Enter Names: ").split()))
cool = True
while cool:
cool = False
for i in range(len(friends)-1):
if friends[i] > friends[i+1]:
coo = friends[i]
friends[i] = friends[i+1]
friends[i+1] = coo
cool = True
print(friends)
I would say functional and straightforward
Answer and Explanation:
Given that total number of records in a file = 100000
Each record consists of= 240 bytes
Given that B= 2400 bytes.
Then total blocks in file = 100000 records * 240 / 2400
= 10000 blocks.
Time that will take for exhaustive read
= s + r + b.btt
= 16 + 8.3 + (10000) * 0.8
= 8024.3 msec
Now as per given X be the number of records that are searched randomly and it takes more than exhaustive read time.
Hence, X (s + r + btt) > 8024.3
X (16+8.3+0.8) > 8024.3
X > 8024.3/25.1
So that, X > 319.69
Hence, atleast 320 random reads should be made to search the file
The chemical energy in food is transformed into mechanical energy through a process called respiration. This isn't really a computers and technology question though. Try Biology next time.
Answer:
It is a data type that only holds whole numbers, a.k.a. integers.
what is the picture about?
