Quicksort with uniform random element
Is it possible while I am counting the length of linked list. I make a random choice for 
every node value I see. If the current node value divides the random choice, I use it as 
a my random element.

For example: if my length of list is 1 and any number n % 1 == 0, I always will choose the 
first element.

Thanks in advance





 

Quicksort with uniform random element
===

Is it possible while I am counting the length of linked list. I make a random choice for 
every node value I see. If the current node value divides the random choice, I use it as 
a my random element.

For example: if my length of list is 1 and any number n % 1 == 0, I always will choose the 
first element.

Thanks in advance





 
