Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating resource.

Please try to avoid dependencies to third-party libraries and frameworks.

Implementation edit is for fixing errors and enhancing with metadata.

Instead of changing the code of the snippet, consider creating another Ada implementation.

Other implementations
import java.util.Arrays;
import java.util.Comparator;
Arrays.sort(items, new Comparator<Item>(){
	public int compare(Item a, Item b){
		return a.p - b.p;
import "sort"
type ItemPSorter []Item
func (s ItemPSorter) Len() int{ return len(s) }
func (s ItemPSorter) Less(i,j int) bool{ return s[i].p<s[j].p }
func (s ItemPSorter) Swap(i,j int) { s[i],s[j] = s[j],s[i] }

func sortItems(items []Item){
	sorter := ItemPSorter(items)
import java.util.Collections;
import java.util.Comparator;
Collections.sort(items, new Comparator<Item>(){
	public int compare(Item a, Item b){
		return a.p - b.p;
items.sort(function(a,b) {
  return compareFieldP(a.p, b.p);
@items = sort { $a->{p} cmp $b->{p} } @items;
items = sorted(items, key=lambda x: x.p)
import std.algorithm.sorting;
sort!("a.p < b.p")(items);
items.sort((a, b) =>, b.p));
items.sort((a, b) => (a.p).compareTo(b.p));
uses fgl;

  TItem = class p: Integer; end;
  TItems = specialize TFPGObjectList<TItem>;

var items: TItems;

  function compare(const a, b: TItem): Integer;
    Result := a.p - b.p;

  items := TItems.Create;
  // Add items here.
sort_by_birth(ListOfMaps) ->
    fun(A, B) ->
      maps:get(birth, A, undefined) =< maps:get(birth, B, undefined)
    end, ListOfMaps).

sort_by_birth(ListOfRecords) -> lists:keysort(#item.birth, ListOfRecords).
sortBy (comparing p) items
Enum.sort_by(items, &(&1.p))
table.sort(items, function(a,b)
	if a.p < b.p then return true end
#include <algorithm>
std::sort(begin(items), end(items), [](const auto& a, const auto& b) { return a.p < b.p; });
case class S(x: Int)
val items = List(S(3), S(4), S(2))
items.sortBy( item: S => item.x )
Array.Sort(items, (a, b) => compareFunc(a.p, b.p));
function cmp($a, $b)
    if ($a->p == $b->p) {
        return 0;

    return ($a->p < $b->p) ? -1 : 1;

usort($items, 'cmp');
import "sort"
less := func(i, j int) bool {
	return items[i].p < items[j].p
sort.Slice(items, less)
items.sort_by_key(|item| item.p);
#include <stdlib.h>
int compareProp (const void *a, const void *b)
    return (*(const Item**)a)->p - (*(const Item**)b)->p;

qsort(items, N, sizeof(Item*), compareProp);
(sort-by :p items)
import qualified Data.List as List
List.sortOn p items
(sort #'< items :key #'p)
import java.util.Comparator; -> x.p))
items.sortedBy { it.p }
from operator import attrgetter
items = sorted(items, key=attrgetter('p'))
@import Foundation;
[items sortedArrayUsingDescriptors:@[[NSSortDescriptor sortDescriptorWithKey:@"p" ascending:YES]]]
items.sort { x -> x.p }
items.sort { x, y -> x.p <=> y.p }