anchor.diff:  
           ! Stack.  This is the auxilliary memory required by quicksort.
           integer :: stack(2,stack_max), nstack
  -
  -        write (6,*) 'bsort',spawning_head
   
           nstack = 0
           lo = 1
  
positive.code:             end if
              tmp_det = spawned_walker_dets(:,i)
          end do
  
          write (6,*) 'asort',spawning_head
  
      contains
  
  
negative.code:             end if
          end do
  
  ! DEBUG test only: verify
          tmp_det = spawned_walker_dets(:,1)
          do i = 2, spawning_head
              if (tmp_det .detgt. spawned_walker_dets(:,i)) then
  