C#

int[] mergeSort (int[] data) {
   if (data.Length == 1)
      return data;
   int middle = data.Length / 2;
   int[] left = mergeSort(subArray(data, 0, middle - 1));
   int[] right = mergeSort(subArray(data, middle, data.Length - 1));
   int[] result = new int[data.Length];
   int dPtr = 0;
   int lPtr = 0;
   int rPtr = 0;
   while (dPtr < data.Length) {
      if (lPtr == left.Length) {
         result[dPtr] = right[rPtr];
         rPtr++;         
      } else if (rPtr == right.Length) {
         result[dPtr] = left[lPtr];
         lPtr++;
      } else if (left[lPtr] < right[rPtr]) {
         result[dPtr] = left[lPtr];
         lPtr++;
      } else {
         result[dPtr] = right[rPtr];
         rPtr++;         
      }
      dPtr++;
   }
   return result;
}

benjamin yap wrote:

The example takes in an integer, base on my code what should i take in? and if i wanan sort by name, how does the algorithm goes?

benjamin yap wrote:

int[] mergeSort (int[] data)

benjamin yap wrote:

public LinkList MergeSort(LinkList data)

  public static void qsort(char[] items) { 
    qs(items, 0, items.Length-1); 
  } 
 
  // A recursive version of Quicksort for characters. 
  static void qs(char[] items, int left, int right)  
  {  
    int i, j;  
    char x, y;  
  
    i = left; j = right;  
    x = items[(left+right)/2];  
  
    do {  
      while((items[i] < x) && (i < right)) i++;  
      while((x < items[j]) && (j > left)) j--;  
  
      if(i <= j) {  
        y = items[i];  
        items[i] = items[j];  
        items[j] = y;  
        i++; j--;  
      }  
    } while(i <= j);  
  
    if(left < j) qs(items, left, j);  
    if(i < right) qs(items, i, right);  
  } 
} 

public void qsort(LinkList list)
        {
            qs(list, 0, list.size - 1);
        }

        public void qs(LinkList list, int left, int right)
        {
            int i, j;
            LinkList
  
            i = left; j = right;
            x = list[(left+right)/2];

            do
            {
              while((list[i] < x) && (i < right)) i++;  
              while((x < list[j]) && (j > left)) j--;  
          
              if(i <= j) 
              {  
                y = list[i];  
                list[i] = list[j];  
                list[j] = y;  
                i++; j--;  
              }  
            } while(i <= j);  
  
            if(left < j) qs(list, left, j);  
            if(i < right) qs(list, i, right);  
  } 

benjamin yap wrote:

which is recommended?

benjamin yap wrote:

how should i store the connection string or etc etc?

newnode = root.SelectSingleNode("Students/Student/[@userid='" + loginform.userid + "']");