Java

File file1=new File("C:\\");
System.out.println("exists=" + file1.exists());

string s1="abc"; 
string s2=s1;
s1="def";
Sop(s1);     // refers to "def"
Sop(s2);     // refers to "abc"

DLL mergesort ( DLL in, int n ) {    // in is the list head, n the number of elements to sort
    check for special cases and handle them separately: in == null, n == 0; n == 1; n == 2 => rearrange if necessary
    m = floor ( n / 2 )
    get first and last elements of left and right sub-lists: f.e. with a for-loop then the left first is the element pointed at by the list head, the right last is the previous of this, 
        last left and  first right are at position m and m+1
    wrap around left and right sub-lists
    mergesort ( in, m, first left )
    first left = in.first
    mergesort ( in, n-m, first right )
    first right = in.first
    merge ( first left, first right )
    return in
}
mergesort ( DLL in, LE first, int n ) {    // in: head, first: first list element, n: number of elements
    as the mergesort function above, except that the trivial case n == 1 must be handled, because this is the break condition for the recursion
    if n == 1 => in.first = first    // in.first means the first element of the list
    this function also calls the 3-argument version of mergesort // the 2-argument version is just the entry point
    all list elements must be addressed via the first one, not via the head, the head is just needed for the trivial case to connect the single LE to it
    recursive calls and merge as above
    return
}
merge (DLL in, LE first left, LE first right, int n ) {
    first decide if the first element is of the left or the right sub-list, connect it to the head and move one step fwd in the sub-list
    finished = f
    counter = 1
    while ( counter < n && !finished ) {
        if next element is of left sub-list and it is not the first one => connect it to the sorted list, move fwd one step
        else if next element is of right sub-list => same for right sub-list
        else if the beginning of one sub-list is reached again => connect the other one to the sorted list, finished = t
        move one step fwd in sorted list so that you are at the current end
        counter++
    }
    return
}