Answer Posted / Amit Chauhan
Here's a simple implementation of Insertion Sort in Python:n```pythonndef insertion_sort(arr):n n = len(arr)n for i in range(1, n):n key = arr[i]n j = i - 1n while j >= 0 and key < arr[j]:n arr[j + 1] = arr[j]n j -= 1n arr[j + 1] = keyn return arr
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Write a program for Sorting an Array. Which sorting will you prefer?
