public void isSorted_Test_SortedWithManyDuplicates()
{
// Arrange
int[] arr = new int[] { 4, 4, 5, 2, 5, 6, 6, 6, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3 };
int[] sorted = new int[] { 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 5, 5, 6, 6, 6 };
// Act
bool result = ArrayIsSorted.isSorted(arr, sorted);
// Assert
Assert.IsTrue(result);
}
public void isSorted_Test_SortedWithLastElementWrong()
{
// Arrange
int[] arr = new int[] { 4, 5, 6, 1, 2, 3 };
int[] sorted = new int[] { 1, 2, 3, 4, 5, 7 };
// Act
bool result = ArrayIsSorted.isSorted(arr, sorted);
// Assert
Assert.IsFalse(result);
}
public void isSorted_Test_SortedWithMissingAndExtraElements()
{
// Arrange
int[] arr = new int[] { 4, 5, 6, 1, 2, 3 };
int[] sorted = new int[] { 1, 2, 4, 5, 6, 7 };
// Act
bool result = ArrayIsSorted.isSorted(arr, sorted);
// Assert
Assert.IsFalse(result);
}
public void isSorted_Test_NotSorted()
{
// Arrange
int[] arr = new int[] { 4, 5, 6, 1, 2, 3 };
int[] sorted = new int[] { 1, 3, 2, 4, 5, 6 };
// Act
bool result = ArrayIsSorted.isSorted(arr, sorted);
// Assert
Assert.IsFalse(result);
}
public void isSorted_Test_SortedWithManyDuplicates_AndMissingDuplicate_AndExtraDuplicate()
{
// Arrange
int[] arr = new int[] { 4, 4, 5, 2, 5, 6, 6, 6, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3 };
// take out a 2, and add a 6
int[] sorted = new int[] { 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6 };
// Act
bool result = ArrayIsSorted.isSorted(arr, sorted);
// Assert
Assert.IsFalse(result);
}
public bool RunOperation(int choice)
{
switch (choice)
{
case 1:
var t1 = new FactorialCalculator();
t1.Run();
break;
case 2:
var t2 = new TelephoneDirectorySearch();
t2.Run();
break;
case 3:
var t3 = new ArrayIsSorted();
t3.Run();
break;
case 4:
var t4 = new MergeSort();
t4.Run();
break;
case 5:
var t5 = new BubbleSort();
t5.Run();
break;
case 6:
var t6 = new BruteForcePasswordGenerator.BruteForcePasswordGenerator();
t6.Run();
break;
case 7:
var t7 = new BruteForcePasswordGeneratorCSharp.BruteForcePasswordGenerator();
t7.Run();
break;
case 8:
var t8 = new QuickSort();
t8.Run();
break;
case 9:
var t9 = new DepthFirstSearch();
t9.Run();
break;
case 10:
var t10 = new BreadthFirstSearch();
t10.Run();
break;
// Quit case
case 0:
return(true);
// Invalid choice case
default:
Console.WriteLine("\nInvalid menu choice selected");
break;
}
return(false);
}
public void ArrayIsSortedTheory(bool expected, int[] arr)
{
Assert.Equal(expected, ArrayIsSorted.Puzzle(arr));
}
