Skip to content

Commit

Permalink
Move code for magic square lecture into project.
Browse files Browse the repository at this point in the history
  • Loading branch information
Clément committed Nov 4, 2024
1 parent deafcab commit 281ce3c
Show file tree
Hide file tree
Showing 7 changed files with 324 additions and 258 deletions.
71 changes: 39 additions & 32 deletions ...ce/code/projects/ListDirectoriesFileRecursively/ListDirectoriesFileRecursively/Program.cs
View file
Original file line number Diff line number Diff line change
Expand Up @@ -3,42 +3,49 @@

class Program
{
static void Main()
static void Main()
{
// We first locate where we currently are.
DirectoryInfo currentDir = new DirectoryInfo(
Directory.GetCurrentDirectory()
);
Console.WriteLine("Starting from " + currentDir + ".");
int count = 5;
// We go up 5 folders or until we reach the
// root folder, whichever comes first.
while (currentDir.Parent != null && count > 0)
{
// We first locate where we currently are.
DirectoryInfo currentDir = new DirectoryInfo(
Directory.GetCurrentDirectory()
);
Console.WriteLine("Starting from " + currentDir + ".");
int count = 5;
// We go up 5 folders or until we reach the
// root folder, whichever comes first.
while (currentDir.Parent != null && count > 0)
{
currentDir = currentDir.Parent;
count--;
Console.WriteLine("Going up to " + currentDir + ".");
}
Console.WriteLine("Now listing files and folders from here:");
ListDir(currentDir.ToString());
currentDir = currentDir.Parent;
count--;
Console.WriteLine("Going up to " + currentDir + ".");
}
// Code in part inspired from
// https://stackoverflow.com/a/929277
static void ListDir(string sourceDir)
Console.WriteLine(
"Now listing files and folders from here:"
);
ListDir(currentDir.ToString());
}

// Code in part inspired from
// https://stackoverflow.com/a/929277
static void ListDir(string sourceDir)
{
try
{
try
{
Console.WriteLine(sourceDir);
Console.WriteLine(sourceDir);

foreach (string file in Directory.GetFiles(sourceDir))
Console.WriteLine(file);
foreach (string file in Directory.GetFiles(sourceDir))
Console.WriteLine(file);

foreach (string directory in Directory.GetDirectories(sourceDir))
ListDir(directory);
}
catch (Exception e)
{
Console.WriteLine(e.Message);
}
foreach (
string directory in Directory.GetDirectories(
sourceDir
)
)
ListDir(directory);
}
catch (Exception e)
{
Console.WriteLine(e.Message);
}
}
}
72 changes: 72 additions & 0 deletions source/code/projects/MagicSquare/MagicSquare/MagicSquare.cs
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
static class MagicSquare
{
public static bool isMagic(int[,] arrayP)
{
bool magicSoFar = true;
if (arrayP.GetLength(0) == arrayP.GetLength(1))
{ // The array is a square.
int magicConstant = 0;
for (int i = 0; i < arrayP.GetLength(1); i++)
{
magicConstant += arrayP[i, i];
}
int testedValue = 0;
for (int i = 0; i < arrayP.GetLength(1); i++)
{
testedValue += arrayP[
i,
arrayP.GetLength(1) - i - 1
];
}
if (testedValue == magicConstant)
{ // The diagonal and anti-diagonal have the same sums.
// We test the rows.
for (int row = 0; row < arrayP.GetLength(0); row++)
{
testedValue = 0;
for (
int col = 0;
col < arrayP.GetLength(1);
col++
)
{
testedValue += arrayP[row, col];
}

if (testedValue != magicConstant)
{
magicSoFar = false;
}
}
// We test the columns.
for (int col = 0; col < arrayP.GetLength(1); col++)
{
testedValue = 0;
for (
int row = 0;
row < arrayP.GetLength(0);
row++
)
{
testedValue += arrayP[row, col];
}

if (testedValue != magicConstant)
{
magicSoFar = false;
}
}
}
else
{ // The diagonal and anti-diagonal have different same sums.
magicSoFar = false;
}
}
else
{ // The array is not a square.
magicSoFar = false;
}

return magicSoFar;
}
}
154 changes: 154 additions & 0 deletions source/code/projects/MagicSquare/MagicSquare/Program.cs
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,154 @@
using System;

class Program
{
static void Main()
{
// Warmup
// Summing the values row per row

int[,] numbers =
{
{ 1, 2, 3, 4 },
{ 5, 6, 7, 8 },
};

int acc;
for (int row = 0; row < numbers.GetLength(0); row++)
{
acc = 0;
for (int col = 0; col < numbers.GetLength(1); col++)
{
acc += numbers[row, col];
}
Console.WriteLine(
"Total for row #" + row + " is " + acc + "."
);
}

// As an exercise, you can adapt this code
// to compute the sums _column per column_.

// Examples courtesy of https://en.wikipedia.org/wiki/Magic_square
int[,] arrayP1 =
{
{ 4, 9, 2 },
{ 3, 5, 7 },
{ 8, 1, 6 },
};
// Check by hand that this square is indeed magic!

int[,] arrayP2 =
{
{ 2, 16, 13, 3 },
{ 11, 5, 8, 10 },
{ 7, 9, 12, 6 },
{ 14, 4, 1, 15 },
};

int[,] arrayP3 =
{
{ 2, 16, 13, 3 },
{ 11, 5, 8, 10 },
{ 7, 9, 12, 6 },
{ 14, 4, 1, 15 },
};

int[,] arrayP4 =
{
{ 1, 23, 16, 4, 21 },
{ 15, 14, 7, 18, 11 },
{ 24, 17, 13, 9, 2 },
{ 20, 8, 19, 12, 6 },
{ 5, 3, 10, 22, 25 },
};

int[,] arrayP5 =
{
{ 13, 22, 18, 27, 11, 20 },
{ 31, 4, 36, 9, 29, 2 },
{ 12, 21, 14, 23, 16, 25 },
{ 30, 3, 5, 32, 34, 7 },
{ 17, 26, 10, 19, 15, 24 },
{ 8, 35, 28, 1, 6, 33 },
};

int[,] arrayP6 =
{
{ 46, 8, 16, 20, 29, 7, 49 },
{ 3, 40, 35, 36, 18, 41, 2 },
{ 44, 12, 33, 23, 19, 38, 6 },
{ 28, 26, 11, 25, 39, 24, 22 },
{ 5, 37, 31, 27, 17, 13, 45 },
{ 48, 9, 15, 14, 32, 10, 47 },
{ 1, 43, 34, 30, 21, 42, 4 },
};

int[,] arrayP7 =
{
{ 61, 3, 2, 64, 57, 7, 6, 60 },
{ 12, 54, 55, 9, 16, 50, 51, 13 },
{ 20, 46, 47, 17, 24, 42, 43, 21 },
{ 37, 27, 26, 40, 33, 31, 30, 36 },
{ 29, 35, 34, 32, 25, 39, 38, 28 },
{ 44, 22, 23, 41, 48, 18, 19, 45 },
{ 52, 14, 15, 49, 56, 10, 11, 53 },
{ 5, 59, 58, 8, 1, 63, 62, 4 },
};

int[,] arrayP8 =
{
{ 31, 76, 13, 36, 81, 18, 29, 74, 11 },
{ 22, 40, 58, 27, 45, 63, 20, 38, 56 },
{ 67, 4, 49, 72, 9, 54, 65, 2, 47 },
{ 30, 75, 12, 32, 77, 14, 34, 79, 16 },
{ 21, 39, 57, 23, 41, 59, 25, 43, 61 },
{ 66, 3, 48, 68, 5, 50, 70, 7, 52 },
{ 35, 80, 17, 28, 73, 10, 33, 78, 15 },
{ 26, 44, 62, 19, 37, 55, 24, 42, 60 },
{ 71, 8, 53, 64, 1, 46, 69, 6, 51 },
};

// This one is *not* magic.
int[,] arrayP9 =
{
{ 31, 76, 13, 36, 81, 18, 29, 74, 11 },
{ 22, 40, 58, 27, 45, 63, 20, 38, 56 },
{ 67, 4, 49, 72, 9, 54, 65, 2, 47 },
{ 30, 75, 12, 32, 77, 14, 34, 79, 16 },
{ 21, 39, 57, 23, 41, 59, 25, 43, 61 },
{ 66, 3, 48, 68, 5, 50, 70, 7, 52 },
{ 35, 80, 17, 28, 73, 10, 33, 78, 15 },
{ 26, 44, 62, 19, 37, 55, 24, 42, 60 },
{ 71, 8, 53, 64, -1, 46, 69, 6, 51 },
};

Console.WriteLine(
"Example 1 is magic: " + MagicSquare.isMagic(arrayP1)
);
Console.WriteLine(
"Example 2 is magic: " + MagicSquare.isMagic(arrayP2)
);
Console.WriteLine(
"Example 3 is magic: " + MagicSquare.isMagic(arrayP3)
);
Console.WriteLine(
"Example 4 is magic: " + MagicSquare.isMagic(arrayP4)
);
Console.WriteLine(
"Example 5 is magic: " + MagicSquare.isMagic(arrayP5)
);
Console.WriteLine(
"Example 6 is magic: " + MagicSquare.isMagic(arrayP6)
);
Console.WriteLine(
"Example 7 is magic: " + MagicSquare.isMagic(arrayP7)
);
Console.WriteLine(
"Example 8 is magic: " + MagicSquare.isMagic(arrayP8)
);
Console.WriteLine(
"Example 9 is magic: " + MagicSquare.isMagic(arrayP9)
);
}
}
Loading

0 comments on commit 281ce3c

Please sign in to comment.