From f932277f63894a1f0649d4936d990a290b02f422 Mon Sep 17 00:00:00 2001
From: Ans Christy <jovanacarmel@gmail.com>
Date: Tue, 29 Jul 2025 12:47:18 +0530
Subject: [PATCH] Added code snippets to insertion sort

---
 app/page_insertionSort/page.js | 47 +++++++++++++++++++++++++++++-----
 1 file changed, 41 insertions(+), 6 deletions(-)

diff --git a/app/page_insertionSort/page.js b/app/page_insertionSort/page.js
index 6398bc3..63ccf37 100644
--- a/app/page_insertionSort/page.js
+++ b/app/page_insertionSort/page.js
@@ -16,7 +16,20 @@ export default function Home() {
   const [animSpd, setAnimSpd] = useState(1);
 
   const codeSnippets = {
-    c: ``,
+    c: `void insertionSort(int arr[], int n) {
+    for (int i = 1; i < n; i++) {
+        int key = arr[i];
+        int j = i - 1;
+
+        while (j >= 0 && arr[j] > key) {
+            arr[j + 1] = arr[j];
+            j--;
+        }
+
+        arr[j + 1] = key;
+    }
+}
+`,
     js: `function bubbleSort(arr) {
   let n = arr.length;
   for (let i = 0; i < n - 1; i++) {
@@ -33,11 +46,33 @@ export default function Home() {
   return arr;
 }
 `,
-    py: `def greet(name):
-    return "Hello, " + name`,
-    cpp: `std::string greet(std::string name) {
-    return "Hello, " + name;
-}`,
+    py: `def insertion_sort(arr):
+    for i in range(1, len(arr)):
+        key = arr[i]
+        j = i - 1
+
+        while j >= 0 and arr[j] > key:
+            arr[j + 1] = arr[j]
+            j -= 1
+
+        arr[j + 1] = key
+`,
+    cpp: `void insertionSort(std::vector<int>& arr) {
+    int n = arr.size();
+
+    for (int i = 1; i < n; ++i) {
+        int key = arr[i];
+        int j = i - 1;
+
+        while (j >= 0 && arr[j] > key) {
+            arr[j + 1] = arr[j];
+            --j;
+        }
+
+        arr[j + 1] = key;
+    }
+}
+`,
     idea: `# first loop with i as element
     # second loop with j as element
         if j>i: