-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProgram.cs
More file actions
105 lines (82 loc) · 2.51 KB
/
Program.cs
File metadata and controls
105 lines (82 loc) · 2.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
namespace CodingProblems
{
using System;
using Strings;
using Sorting;
public class Program
{
public static void Main(string[] args)
{
// var g = Sorting.FindNGreatestElement(new int[] {1,3}, new int[] {1,8,10}, 4);
// Console.WriteLine(g);
//
// var o = Sorting.SortNumbers(new int[2][] {new int[] {1,4,6}, new int[] {2,3,10,15}});
// foreach(var i in o)
// {
// Console.WriteLine(i);
// }
var o = Sorting.SelectionSort(new int[] {4,7,3,1,9});
foreach(var i in o)
{
Console.WriteLine(i);
}
}
public static void TestStrings()
{
var input = "sdfljad";
Console.WriteLine(Strings.Factorial(input.Length));
var permuts = Strings.Permutations(input);
foreach(var permut in permuts)
{
Console.WriteLine(permut);
}
Console.WriteLine(permuts.Count);
}
public static void TestSorting()
{
int[] output = null;
output = Sorting.MergeSort(new int[] { 4, 6, 1, 3, 5, 2 });
foreach (var c in output)
{
Console.Write(c);
}
Console.WriteLine();
output = Sorting.QuickSort(new int[] { 6, 4, 1, 3, 2, 5 });
foreach (var c in output)
{
Console.Write(c);
}
Console.WriteLine();
output = Sorting.QuickSort(new int[] { 1, 2, 3, 4, 5, 6 });
foreach (var c in output)
{
Console.Write(c);
}
Console.WriteLine();
output = Sorting.BubbleSort(new int[] { 6, 5, 4, 3, 2, 1 });
foreach (var c in output)
{
Console.Write(c);
}
Console.WriteLine();
output = Sorting.BubbleSort(new int[] { 6, 4, 1, 3, 2, 5 });
foreach (var c in output)
{
Console.Write(c);
}
Console.WriteLine();
output = Sorting.BubbleSort(new int[] { 1, 2, 3, 4, 5, 6 });
foreach (var c in output)
{
Console.Write(c);
}
Console.WriteLine();
output = Sorting.QuickSort(new int[] { 6, 5, 4, 3, 2, 1 });
foreach (var c in output)
{
Console.Write(c);
}
Console.WriteLine();
}
}
}