Function Check-For-Collinear(P,n)
 if (n ≤ 2) then
   return(false)
 else
   Sort the points in P based on their x-coordinates.
   for ( i = 1 to n) do
     Compute the slopes of the segments (P ¯ [i], P[j]) for each 
     j = 1, 2,i − 1, i + 1, i + 2, . . . , n and store 
     these in an auxiliary array A[i].
   end for
   for ( i = 1 to n) do
     Sort the auxiliary array A[i].
   end for
   for (i = 1 to n − 2) do
     for (j = i + 1 to n − 1) do
       Let x = slope(P ¯ [i], P[j]).
       Perform a binary search on A[j] to check if there is a 
       point P[k] such that slope(P[j], P[k]) = x.

       if (such a point P[k] exists) then
         Points P[i], P[j] and P[k] are collinear.
       end if
     end for
   end for
   Declare that no three points are collinear.
 end if