Algorithm Pseudocode:
LomutoPartition(A[left, right])
 pivot = A[left]
 s = left
 for i=left+1 to right do
  if A[i] < pivot
   s=s+1
   swap(A[s], A[i])
 swap(A[left], A[s])
 return s

Like other partitioning algorithms, Lomuto Partition selects the first element as the pivot and puts all values less than the pivot on the left and all values greater than or equal to the pivot on the right.

Lomuto Partition uses One-directional scanning technique that maintains three distinct partitions: those less than the pivot, those greater than the pivot and the unknown section. On each iteration the unknown partitions is decreased by 1.