**Running Time of Algorithms**

### Problem Statement :

n a previous challenge you implemented the Insertion Sort algorithm. It is a simple sorting algorithm that works well with small or mostly sorted data. However, it takes a long time to sort large unsorted data. To see why, we will analyze its running time. Running Time of Algorithms The running time of an algorithm for a specific input depends on the number of operations executed. The greater the number of operations, the longer the running time of an algorithm. We usually want to know how many operations an algorithm will execute in proportion to the size of its input, which we will call . What is the ratio of the running time of Insertion Sort to the size of the input? To answer this question, we need to examine the algorithm. Analysis of Insertion Sort For each element in an array of numbers, Insertion Sort compares the number to those to its left until it reaches a lower value element or the start. At that point it shifts everything to the right up one and inserts into the array. How long does all that shifting take? In the best case, where the array was already sorted, no element will need to be moved, so the algorithm will just run through the array once and return the sorted array. The running time would be directly proportional to the size of the input, so we can say it will take time. However, we usually focus on the worst-case running time (computer scientists are pretty pessimistic). The worst case for Insertion Sort occurs when the array is in reverse order. To insert each number, the algorithm will have to shift over that number to the beginning of the array. Sorting the entire array of numbers will therefore take operations, which is (almost ). Computer scientists just round that up (pick the dominant term) to and say that Insertion Sort is an " time" algorithm. Challenge Can you modify your previous Insertion Sort implementation to keep track of the number of shifts it makes while sorting? The only thing you should print is the number of shifts made by the algorithm to completely sort the array. A shift occurs when an element's position changes in the array. Do not shift an element if it is not necessary. Function Description Complete the runningTime function in the editor below. runningTime has the following parameter(s): int arr[n]: an array of integers Returns int: the number of shifts it will take to sort the array Input Format The first line contains the integer n, the number of elements to be sorted. The next line contains n integers of arr[ arr[0] . . .arr[ n - 1 ] ] .

### Solution :

` ````
Solution in C :
In C++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int insertionSortCount(vector <int> ar) {
int n = ar.size();
int count=0;
for(int i=1;i<n;i++){
int curr = ar[i];
for(int j=i-1;j>=0;j--){
if(ar[j]>curr){
ar[j+1]=ar[j];
count++;
if(j==0)
ar[j]=curr;
}
else{
ar[j+1]=curr;
j=-1;
}
}
}
return count;
}
/* Tail starts here */
int main() {
vector <int> _ar;
int _ar_size;
cin >> _ar_size;
for(int _ar_i=0; _ar_i<_ar_size; _ar_i++) {
int _ar_tmp;
cin >> _ar_tmp;
_ar.push_back(_ar_tmp);
}
cout<<insertionSortCount(_ar);
return 0;
}
In Java :
/* Head ends here */
import java.util.*;
public class Solution {
static void insertionSort(int[] ar) {
int count =0;
for(int i=1;i<ar.length;i++){
int n= ar[i];
int j=i-1;
while(j>=0 && ar[j]>n){
//System.err.print(i+" ");
ar[j+1]=ar[j]; //shift right
j--;
count++;
}
ar[j+1]= n;
}
System.out.println( count);
}
/* Tail starts here */
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] ar = new int[n];
for(int i=0;i<n;i++){
ar[i]=in.nextInt();
}
insertionSort(ar);
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>
/* Head ends here */
void insertionSort(int ar_size, int * ar,int *shifts) {
int temp=ar[ar_size-1],i;
for(i=ar_size-2;i>=0;i--)
{
if(ar[i]>temp){ ar[i+1]=ar[i];*shifts=*shifts+1;}
else break;
//for(j=0;j<ar_size;j++)printf("\n%d",ar[j]);
}
ar[i+1]=temp;
}
/* Tail starts here */
int main() {
int _ar_size,i,j,shifts=0;
scanf("%d", &_ar_size);
int _ar[_ar_size], _ar_i;
for(_ar_i = 0; _ar_i < _ar_size; _ar_i++) {
scanf("%d", &_ar[_ar_i]);
}
for(i=2;i<=_ar_size;i++)
{insertionSort(i, _ar,&shifts);
}
printf("%d",shifts);
return 0;
}
In Python3 :
size = int(input())
array = input().split(" ")
arr = ['None'] * size
for i in range(size):
arr[i] = int(array[i])
i = 1
count = 0
while i < size:
tmp = arr[i]
j = i - 1
while arr[j] > tmp and j > -1:
arr[j+1] = arr[j]
j = j - 1
count = count + 1
arr[j+1] = tmp
i = i + 1
print(count)
```

## View More Similar Problems

## Insert a Node at the head of a Linked List

Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below

View Solution →## Insert a node at a specific position in a linked list

Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its data attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is e

View Solution →## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

View Solution →## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

View Solution →## Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio

View Solution →## Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

View Solution →