diff --git a/16_FirstContribution/Algorithms/TravellingSalesman.java b/16_FirstContribution/Algorithms/TravellingSalesman.java
new file mode 100644
index 0000000..a3cfd00
--- /dev/null
+++ b/16_FirstContribution/Algorithms/TravellingSalesman.java
@@ -0,0 +1,62 @@
+package Algorithms;
+
+public class TravellingSalesman 
+    {
+ 
+     
+        static int tsp(int[][] graph, boolean[] v, 
+                       int currPos, int n, 
+                       int count, int cost, int ans) 
+        {
+     
+            
+            if (count == n && graph[currPos][0] > 0) 
+            {
+                ans = Math.min(ans, cost + graph[currPos][0]);
+                return ans;
+            }
+     
+            
+            for (int i = 0; i < n; i++) 
+            {
+                if (v[i] == false && graph[currPos][i] > 0) 
+                {
+     
+                   
+                    v[i] = true;
+                    ans = tsp(graph, v, i, n, count + 1,
+                              cost + graph[currPos][i], ans);
+     
+                    
+                    v[i] = false;
+                }
+            }
+            return ans;
+        }
+     
+        public static void main(String[] args)
+        {
+     
+            
+            int n = 4;
+     
+            int[][] graph = {{0, 10, 15, 20},
+                             {10, 0, 35, 25},
+                             {15, 35, 0, 30},
+                             {20, 25, 30, 0}};
+     
+            
+            boolean[] v = new boolean[n];
+     
+            
+            v[0] = true;
+            int ans = Integer.MAX_VALUE;
+     
+        
+            ans = tsp(graph, v, 0, n, 1, 0, ans);
+     
+            
+            System.out.println(ans);
+        }
+    
+}