Heap Sort is a sorting algorithm that makes use of the heap data structure. Each time the root element of the heap i.e. the largest element is removed and stored in an array. It is replaced by the rightmost leaf element and then the heap is reestablished. This is done until there are no more elements left in the heap and the array is sorted.A program that demonstrates heap sort in C# is given as follows.Example Live Demousing System; namespace HeapSortDemo {    public class example {       static void heapSort(int[] arr, int n) {         ... Read More

Insertion Sort is a sorting algorithm that takes an element at a time and inserts it in its correct position in the array. This process is continued until the array is sorted.A program that demonstrates insertion sort in C# is given as follows.Example Live Demousing System; namespace InsertionSortDemo {    class Example {       static void Main(string[] args) {          int[] arr = new int[10] { 23, 9, 85, 12, 99, 34, 60, 15, 100, 1 };          int n = 10, i, j, val, flag;          Console.WriteLine("Insertion Sort");   ... Read More

Selection Sort is a sorting algorithm that finds the minimum value in the array for each iteration of the loop. Then this minimum value is swapped with the current array element. This procedure is followed until the array is sorted.A program that demonstrates selection sort in C# is given as follows.Example Live Demousing System; public class Example {    static void Main(string[] args) {       int[] arr = new int[10] { 56, 1, 99, 67, 89, 23, 44, 12, 78, 34 };       int n = 10;       Console.WriteLine("Selection sort");       Console.Write("Initial array ... Read More

The highest occurring character in a string is one that occurs most number of times. This can be demonstrated using the following example.String: apples are red The highest occurring character in the above string is e as it occurs 3 times, which is more than the occurrence of any other character.A program that obtains the highest occurring character in a string using C# is given as follows.Example Live Demousing System; namespace charCountDemo {    public class Example {       public static void Main() {          String str = "abracadabra";          int []charCount = ... Read More

To find intersection of two lists in C#, use the Intersect() method.The following is our list 1.List list1 = new List(); list1.Add(2); list1.Add(3); list1.Add(5); list1.Add(7);The following is our list 2.List list2 = new List(); list2.Add(5); list2.Add(4); list2.Add(6); list2.Add(8);The following is the code to find the intersection of two lists in C#.Example Live Demousing System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Demo {    public class Program {       public static void Main(String[] args) {          List list1 = new List();          list1.Add(2);          list1.Add(3);          list1.Add(5); ... Read More

A MAC address of a device is a media access control address. It is a unique identifier assigned to a network.The MAC address technology is used by many technologies such as Ethernet, Bluetooth, Fibre Channel, etc.Here, we will use the following method to check for all the network interfaces on the computer.NetworkInterface.GetAllNetworkInterfacesFor this, the NetworkInterfaceType Enumeration is also used to specify the type of network interfaces.string addr = ""; foreach (NetworkInterface n in NetworkInterface.GetAllNetworkInterfaces()) {    if (n.OperationalStatus == OperationalStatus.Up) {       addr += n.GetPhysicalAddress().ToString();       break;    } } return addr;Above, we have used the ... Read More

Extension methods are static methods, which are called as if they were instance methods on the extended type. With Extension methods, you can add methods to existing types without even creating a new derived type, recompiling, or modifying the original type.The following is the extension method we have created.public static int myExtensionMethod(this string str) {    return Int32.Parse(str); }Let us see an example wherein we have used extension method.Example Live Demousing System; using System.Text; namespace Program {    public static class Demo {       public static int myExtensionMethod(this string str) {          return Int32.Parse(str);     ... Read More

The break statement terminates the loop and transfers execution to the statement immediately following the loop.When the break statement is encountered inside a loop, the loop is immediately terminated and program control resumes at the next statement following the loop.Let us see an example to learn how to work with break statement in while loop. The following code snippet terminates the loop using break statement.if (a > 15) {    break; }The following is the complete code.Example Live Demousing System; namespace Demo {    class Program {       static void Main(string[] args) {          /* local ... Read More

It lets you modify the compiler's line number and (optionally) the file name output for errors and warnings. Let us see some examples. #line 100 "demo" int a; // CS0168 on line 100 int b; // CS0168 on line 101 int c; // CS0168 on line 102 As shown above the example reports three warnings associated with line numbers. The #line 100 directive forces the line number to be 100 and until the next #line directive, the filename will be reported as "demo”. Let’s see ... Read More

To access Array elements in a foreach statement, use the numeric index.Let’s say the following is our code.Example Live Demousing System; namespace ArrayApplication {    class MyArray {       static void Main(string[] args) {          int [] n = new int[10]; /* n is an array of 10 integers */          /* initialize elements of array n */          for ( int i = 0; i < 10; i++ ) {             n[i] = i + 100;          }       ... Read More