4K
Solutions
4K
Contributors
An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.
Sign up to Post
Load Recent Content
aba
abb
abd
abf
one
two
three
four
five
six
seven
abd
abe
eleven
four
eight
one
six
aba
abb
abf
five
seven
three
two
List<Point> PolyPoints = new List<Point>();
PolyPoints.Add(new Point(3, 4));
PolyPoints.Add(new Point(5, 11));
PolyPoints.Add(new Point(12, 8));
PolyPoints.Add(new Point(9, 5));
PolyPoints.Add(new Point(5, 6));
static void Main(string[] args)
{
int[] a = { 1, 2, 3 };
int[] b = { 1, 2, 3 };
int[] result = Sort(MergeTwoArrays(a, b));
foreach (var item in result)
{
Console.Write(item+ " ");
}
Console.Read();
}
public static int[] MergeTwoArrays(int[] a, int[]b)
{
int aLength = a.Length;
int bLength = b.Length;
int totalLength = aLength + bLength;
int[] c = new int[totalLength];
for (int i = 0; i < a.Length; i++)
{
c[i] = a[i];
}
int k = a.Length;
for (int i = 0; i < b.Length; i++)
{
c[k] = b[i];
k++;
}
return c;
}
public static int[] Sort(int[] a)
{
int i, j, temp, minIndex;
for (i = 0; i < a.Length; i++)
{
minIndex = i;
…
4K
Solutions
4K
Contributors
An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.