diff --git a/hacker-rank/algorithms/sorting/Mark and Toys/Mark and Toys.cpp b/hacker-rank/algorithms/sorting/Mark and Toys/Mark and Toys.cpp
new file mode 100644
index 0000000..4329790
--- /dev/null
+++ b/hacker-rank/algorithms/sorting/Mark and Toys/Mark and Toys.cpp	
@@ -0,0 +1,33 @@
+#include <iostream>
+#include<bits/stdc++.h>
+using namespace std;
+
+int main() {
+	int n,x,s=0;
+	std::vector<int> v;
+	cin>>n>>x;
+	int a[n];
+	for(int i=0;i<n;i++)
+	{
+	    cin>>a[i];
+	}
+	sort(a,a+n);
+	for(int i=0;i<n;i++)
+	{
+	    s+=a[i];
+	    if(s>x)
+	    {
+	        break;
+	    }
+	    v.push_back(a[i]);
+	}
+	cout<<v.size()<<endl;
+	
+	return 0;
+}
+
+//Input:
+//7 50
+//1 12 5 111 200 1000 10
+//Output:
+//4
diff --git a/hacker-rank/algorithms/sorting/Sorting_Bubble Sort/Sorting_Bubble Sort.cpp b/hacker-rank/algorithms/sorting/Sorting_Bubble Sort/Sorting_Bubble Sort.cpp
new file mode 100644
index 0000000..0987bf0
--- /dev/null
+++ b/hacker-rank/algorithms/sorting/Sorting_Bubble Sort/Sorting_Bubble Sort.cpp	
@@ -0,0 +1,55 @@
+// Best Case Time Complexity: O(n). Best case occurs when array is already sorted.
+// Worst and Average Case Time Complexity: O(n^2). Worst case occurs when array is reverse sorted.
+
+// Auxiliary Space: O(1)
+
+#include <iostream>
+#include<bits/stdc++.h>
+using namespace std;
+
+void bubble_sort(int a[],int n)
+{
+    int flag,p=0;
+    for(int i=0;i<n-1;i++)
+    {   flag=0;
+        for(int j=0;j<n-1-i;j++)
+        {
+            if(a[j]>a[j+1])
+            {
+                swap(a[j],a[j+1]);
+                flag=1;
+                p++;
+            }
+        }
+        if(flag==0)
+        {
+            break;
+        }
+    }
+
+    cout<<"Array is sorted in"<<" "<<p<<" "<<"swaps."<<endl;
+    cout<<"First Element:"<<" "<<a[0]<<endl;
+    cout<<"Last Element:"<<" "<<a[n-1]<<endl;
+    
+}
+
+int main() {
+    int n;
+    cin>>n;
+    int a[n];
+    for(int i=0;i<n;i++)
+    {
+        cin>>a[i];
+    }
+    bubble_sort(a,n);
+    return 0;
+}
+
+
+// Input:
+// 4
+// 3 12 4 2
+// Output:
+// Array is sorted in 4 swaps.
+// First Element: 2
+// Last Element: 12