Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- namespace QuickSortDemo
- {
- class Example
- {
- static public void merge(string[] arr, int p, int q, int r)
- {
- int i, j, k;
- int n1 = q - p + 1;
- int n2 = r - q;
- string[] L = new String[n1];
- string[] R = new String[n2];
- for (i = 0; i < n1; i++)
- {
- L[i] = arr[p + i];
- }
- for (j = 0; j < n2; j++)
- {
- R[j] = arr[q + 1 + j];
- }
- i = 0;
- j = 0;
- k = p;
- while (i < n1 && j < n2)
- {
- if (L[i].Length <= R[j].Length)
- {
- arr[k] = L[i];
- i++;
- }
- else
- {
- arr[k] = R[j];
- j++;
- }
- k++;
- }
- while (i < n1)
- {
- arr[k] = L[i];
- i++;
- k++;
- }
- while (j < n2)
- {
- arr[k] = R[j];
- j++;
- k++;
- }
- }
- static public void mergeSort(string[] arr, int p, int r)
- {
- if (p < r)
- {
- int q = (p + r) / 2;
- mergeSort(arr, p, q);
- mergeSort(arr, q + 1, r);
- merge(arr, p, q, r);
- }
- }
- static void Main(string[] args)
- {
- string[] arr = { "a","ala","kokokosdasderfni","Alicja","kot","dupa"};
- int n = 6, i;
- Console.WriteLine("Merge Sort");
- Console.Write("Initial array is: ");
- for (i = 0; i < n; i++)
- {
- Console.Write(arr[i] + " ");
- }
- mergeSort(arr, 0, n - 1);
- Console.Write("\nSorted Array is: ");
- for (i = 0; i < n; i++)
- {
- Console.Write(arr[i] + " ");
- }
- Console.ReadKey();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement