Answer:
def insSort(arr):
ct=0;
for i in range(1, len(arr)):
key = arr[i]
j = i-1
while j >=0 and key < arr[j] :
arr[j+1] = arr[j]
j -= 1
ct=ct+1;
arr[j+1] = key
return arr,ct;
print(insSort([2,1]))
Output of the program is also attached.
Answer:
Check the explanation
Explanation:
The programmable code to solve the question above will be written in a python programming language <u><em>(which is a high-level, interpreted, general-purpose programming language.)</em></u>
<u><em /></u>
f = open('thisFile.txt', 'r')
w = open('thatFile.txt', 'w')
count = 0
for line in f:
if count % 2 == 0:
w.write(line)
count += 1
w.close()
f.close()