What is the answer to number 13
1 answer:
You might be interested in
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:
The code has been written in Java.
The source code of the file has been attached to this response. The source code contains comments explaining important lines of the program.
A sample output got from a run of the application has also been attached.
To interact with the program, kindly copy the code into your Java IDE and save as Cafe.java and then run the program.
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark">
java
</span>
