18 Pseudocode Partition Partition(A,p,r)  pivot = A[r];  i = p – 1;  for j = p to r – 1 do  {*}  if A[j]  pivot  then i ++; Verwissel A[i] en A
{"Image DocumentName": "Pseudocode Partition Partition(A,p,r) pivot = A[r]; i = p \u2013 1;", "Image ImageDescription": "for j = p to r \u2013 1 do. { } if A[j] \u00a3 pivot. then. i ++; Verwissel A[i] en A[j] Verwissel A[i+1] en A[r]; return i+1; Invariant: bij   geldt voor elke k, p \u00a3 k \u00a3 r: Als p \u00a3 k \u00a3 i, dan A[k] \u00a3 pivot. Als i+1 \u00a3 k \u00a3 j \u2013 1, dan A[k] > pivot. Als k=r, dan A[k]=pivot.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}