Sorting Algorithms

1. Merge Sort: It is divider and conquer technique.
1. Divide the array into two halves using MergeSort() function.
2. Merge the two sub arrays into single in sorted order using Merge() function.
3. Merge sort program in c#
4. Time complexity O(n logn).
2. Insertion Sort:
1. Its like Playing cards., take an element, Find location / index to insert this new element, by Comparing with all existing elements.
2. InsertionSort in C#
3. Time complexity O(n * n).
3. Selection Sort:
1. Sorts an array by repeatedly finding the minimum element from unsorted part of array.
2. Selection sort in c#
3. Time complexity O(n * n).

LINQ Single vs SingleOrDefault vs First vs FirstOrDefault

	Single()	SingleOrDefault()	First()	FirstOrDefault()
Description	Returns a single, specific element of a sequence	Returns a single, specific element of a sequence, or a default value if that element is not found	Returns the first element of a sequence	Returns the first element of a sequence, or a default value if no element is found
Exception thrown when	There are 0 or more than 1 elements in the result	There is more than one element in the result	There are no elements in the result	Only if the source is null (they all do this)
When to use	If exactly 1 element is expected; not 0 or more than 1	When 0 or 1 elements are expected	When more than 1 element is expected and you want only the first	When more than 1 element is expected and you want only the first. Also it is ok for the result to be empty

Const vs Static vs Readonly in C#

Const vs Static vs Readonly in C#