Calculate all shortest paths from one coordinate to the other

assignment.cpp

#include <stdio.h>
#include <tchar.h>

#include <vector>
#include <string>
#include <math.h>
#include <iostream>

using namespace std;

static char* commands[] = { "W", nullptr, "E", "S", nullptr, "N" };

vector<string> CalculatePath(int startX, int startY, int endX, int endY)
{
	vector<string> result;
	int delta[] = { (endX - startX), (endY - startY) };

	for (int axis = 0; axis < 2; axis += 1)
	{
		if (delta[axis] != 0)
		{
			delta[axis] /= abs(delta[axis]);
			char* moveCommand = commands[(axis * 3) + 1 + delta[axis]];
			vector<string> paths = CalculatePath(startX + (delta[0] * abs(1 - axis)), startY + (delta[1] * axis), endX, endY);
			if (paths.empty())
			{
				result.push_back(moveCommand);
			}
			else
			{
				for (const string& path : paths)
				{
					result.push_back(moveCommand + path);
				}
			}
		}
	}
	return result;
}

int _tmain(int argc, _TCHAR* argv[])
{
	vector<string> paths = CalculatePath(0, 0, 8, 1);

	for (const string& path : paths)
	{
		cout << path << endl;
	}
	int waitVar;
	cin >> waitVar;
	return 0;
}