Kinshuk2003 details

challengers-list.md

@@ -2,3 +2,4 @@
 1. [Mrinal](https://github.com/mrinal1224)
 2. [Shivay](https://github.com/shivaylamba)
 3. [Raghav](https://github.com/raghavdhingra)
+4. [Kinshuk](https://github.com/Kinshuk2003)

contributors/Kinshuk2003/Kinshuk2003.md

@@ -0,0 +1,8 @@
+---
+name: Kinshuk Goyal
+github_user_name: Kinshuk2003
+url_of_github_issue: https://github.com/scaleracademy/scaler-september-open-source-challenge/issues/205
+your_favroite_programming_language: C, C++, Python, HTML, CSS, JAVASCRIPT
+your_hosted_github_pages_link: https://kinshuk2003.github.io/
+your_hosted_github_pages_repository_link: https://github.com/Kinshuk2003/Kinshuk2003.github.io
+---

contributors/Kinshuk2003/gist-solutions.md

@@ -0,0 +1,4 @@
+# links to gist
+
+1. [software development topic](https://gist.github.com/Kinshuk2003/4cea2ff56db2b4da9f26e36f6b11bfee)
+2. [Code snippet](https://gist.github.com/Kinshuk2003/ee923b2feaf424367d34e9eae452ec86)

contributors/Kinshuk2003/insertionsort.py

@@ -0,0 +1,22 @@
+#!/usr/bin/python
+# -*- coding: utf-8 -*-
+
+
+def InsertionSort(arr):
+
+    n = len(arr)
+
+    for i in range(0, n):
+        key = arr[i]
+        j = i - 1
+        while j >= 0 and key < arr[j]:
+            arr[j + 1] = arr[j]
+            j -= 1
+        arr[j + 1] = key
+
+
+# driver code
+
+arr = [6, 5, 3, 2, 8, 10, 9]
+InsertionSort(arr)
+print(arr)