diff --git a/Beginner/Travelling-sales-man.cpp b/Beginner/Travelling-sales-man.cpp
new file mode 100644
index 00000000..85e8fe96
--- /dev/null
+++ b/Beginner/Travelling-sales-man.cpp
@@ -0,0 +1,90 @@
+#include<iostream>
+
+using namespace std;
+
+int ary[10][10],completed[10],n,cost=0;
+
+void takeInput()
+{
+	int i,j;
+
+	cout<<"Enter the number of villages: ";
+	cin>>n;
+
+	cout<<"\nEnter the Cost Matrix\n";
+
+	for(i=0;i < n;i++)
+	{
+		cout<<"\nEnter Elements of Row: "<<i+1<<"\n";
+
+		for( j=0;j < n;j++)
+			cin>>ary[i][j];
+
+		completed[i]=0;
+	}
+
+	cout<<"\n\nThe cost list is:";
+
+	for( i=0;i < n;i++)
+	{
+		cout<<"\n";
+
+		for(j=0;j < n;j++)
+			cout<<"\t"<<ary[i][j];
+	}
+}
+
+int least(int c)
+{
+	int i,nc=999;
+	int min=999,kmin;
+
+	for(i=0;i < n;i++)
+	{
+		if((ary[c][i]!=0)&&(completed[i]==0))
+			if(ary[c][i]+ary[i][c] < min)
+			{
+				min=ary[i][0]+ary[c][i];
+				kmin=ary[c][i];
+				nc=i;
+			}
+	}
+
+	if(min!=999)
+		cost+=kmin;
+
+	return nc;
+}
+
+void mincost(int city)
+{
+	int i,ncity;
+
+	completed[city]=1;
+
+	cout<<city+1<<"--->";
+	ncity=least(city);
+
+	if(ncity==999)
+	{
+		ncity=0;
+		cout<<ncity+1;
+		cost+=ary[city][ncity];
+
+		return;
+	}
+
+	mincost(ncity);
+}
+
+int main()
+{
+	takeInput();
+
+	cout<<"\n\nThe Path is:\n";
+	mincost(0); //passing 0 because starting vertex
+
+	cout<<"\n\nMinimum cost is "<<cost;
+
+	return 0;
+}