diff --git a/Sorting/Bubble Sort/in_R.r b/Sorting/Bubble Sort/in_R.r
new file mode 100644
index 0000000..b1c03f6
--- /dev/null
+++ b/Sorting/Bubble Sort/in_R.r	
@@ -0,0 +1,19 @@
+bubbleSort <- function(vector) {
+  n <- length(vector) #stores the length of the input vector/ array
+  
+  for (i in 1:(n - 1)) { #first loop is for passes 
+    for (j in 1:(n - i)) { #second loop will run for the pairs
+      if (vector[j] > vector[j + 1]) {
+        temp <- vector[j] # Swap arr[j] and arr[j + 1]
+        vector[j] <- vector[j + 1]
+        vector[j + 1] <- temp
+      }
+    }
+  }
+  return(vector)
+}
+
+# User Input:
+user_vec <- c(6, 10, 4, 34, 25, 90, 12, 22, 11, 90)
+sortedVector <- bubbleSort(user_vec)
+cat("Sorted Array:", sortedVector, "\n")
diff --git a/Sorting/Selection-sort/in_R.r b/Sorting/Selection-sort/in_R.r
new file mode 100644
index 0000000..6cfa572
--- /dev/null
+++ b/Sorting/Selection-sort/in_R.r
@@ -0,0 +1,19 @@
+selectionSort <- function(vector) {
+  n <- length(vector) #stores the length of the input vector/ array
+  
+for (i in 1:(n - 1)) {    #first loop is for passes 
+    for (j in (i + 1):n) {    #second loop will run for the pairs
+      if (vector[i] > vector[j]) {  #higher index must have higher valu, if not, swap.
+        temp <- vector[i]     #swap arr[j] and arr[j + 1] 
+        vector[i] <- vector[j]
+        vector[j] <- temp
+      }
+    }
+  }
+  return(vector)
+}
+
+# User Input:
+user_vec <- c(64, 30, 60,90, 25, 12, 2, 11)
+sortedVector <- selectionSort(user_vec)
+cat("Sorted Array:", sortedVector, "\n")