From 4f7a95fd6858fb43e918c1d8722cb700b1f59319 Mon Sep 17 00:00:00 2001
From: Pritesh Agrawal <priteshagrawal0@gmail.com>
Date: Sat, 8 Oct 2022 18:24:16 +0530
Subject: [PATCH 1/2] renamed folder correctly for TravellingSalesmanProblem

---
 .../TravellingSalesmanProblem.cpp                                 | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename Algorithms/{#include <bits => TravellingSalesmanProblem}/TravellingSalesmanProblem.cpp (100%)

diff --git a/Algorithms/#include <bits/TravellingSalesmanProblem.cpp b/Algorithms/TravellingSalesmanProblem/TravellingSalesmanProblem.cpp
similarity index 100%
rename from Algorithms/#include <bits/TravellingSalesmanProblem.cpp
rename to Algorithms/TravellingSalesmanProblem/TravellingSalesmanProblem.cpp

From 9dee64fe5453ec797ad1a45f4525babd0c668c30 Mon Sep 17 00:00:00 2001
From: Pritesh Agrawal <priteshagrawal0@gmail.com>
Date: Sat, 8 Oct 2022 18:25:12 +0530
Subject: [PATCH 2/2] Fixed typo in function name

---
 .../TravellingSalesmanProblem/TravellingSalesmanProblem.cpp     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Algorithms/TravellingSalesmanProblem/TravellingSalesmanProblem.cpp b/Algorithms/TravellingSalesmanProblem/TravellingSalesmanProblem.cpp
index 81f0f54c..c7860b05 100644
--- a/Algorithms/TravellingSalesmanProblem/TravellingSalesmanProblem.cpp
+++ b/Algorithms/TravellingSalesmanProblem/TravellingSalesmanProblem.cpp
@@ -2,7 +2,7 @@
 using namespace std;
 #define V 4
 
-int travllingSalesmanProblem(int graph[][V], int s)
+int travellingSalesmanProblem(int graph[][V], int s)
 {
 	vector<int> vertex;
 	for (int i = 0; i < V; i++)