diff --git a/learn-git/selectionSort.js b/learn-git/selectionSort.js
index 3ed23f8..55d7144 100644
--- a/learn-git/selectionSort.js
+++ b/learn-git/selectionSort.js
@@ -1,32 +1,19 @@
-/*
-This task requires you to use the pseudocode below to implement selection sort
-PSEUDOCODE
-procedure selection sort 
-   arr  : array of items
-   n     : size of arr
-   temp  : temporary var to be used for swaping
+var arr = [64, 25, 12, 22, 11];
+var n = arr.length;
+var temp;
 
-   for i = 0 to n 
-        //set current element as minimum
-        min = i    
-        
-        //check the element to be minimum 
-
-        for j = i+1 to n 
-            if arr[min] > arr[j] then
-                min = j;
-
-                //swap the minimum element with the current element
-
-                temp = arr[i]
-                arr[i] = arr[min]
-                arr[min] = temp
-
-            end if
-        end for
-    end for
- 
-end procedure
-
-You can test your solution using  [64, 25, 12, 22, 11]
-*/
\ No newline at end of file
+for(var i = 0; i<n;i = i + 1){
+	var min = i;
+	for(var j = i+1; j < n;j = j+1){
+		if(arr[j] < arr[min]){
+			min = j;
+			
+		}
+	}
+  if(arr[min] !== i){
+      var temp = arr[i];
+			arr[i] = arr[min]
+			arr[min] = temp
+  }
+}
+document.write(arr)