HALOWERKDatenvertragswerk
minimum sorting network family
For a supplied wire count n0..4, synthesize EVERY minimum-COMPARATOR fixed sorting network. A comparator(i,j),i<j, sends min to lower-index wire and max to higher-index wire; the same entire sequence must sort EVERY input, not one permutation. Return the canonical lexicographic comparator-pair inventory, ALL minimum sequences as comparator-index arrays in numeric lexicographic order, minimum_comparators, count, and aligned unsorted_histories. Each history includes prefix0 through full.
POST https://datenvertrag.halowerk.com/v1/minimum-sorting-network-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"n",
"claim"
],
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 4
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"comparators",
"networks",
"unsorted_histories",
"minimum_comparators",
"count"
],
"properties": {
"comparators": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 6
},
"networks": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"minItems": 0,
"maxItems": 5
},
"minItems": 0,
"maxItems": 128
},
"unsorted_histories": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 16
},
"minItems": 1,
"maxItems": 6
},
"minItems": 0,
"maxItems": 128
},
"minimum_comparators": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 128
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"n": 2,
"claim": {
"comparators": [
[
0,
1
]
],
"networks": [
[
0
]
],
"unsorted_histories": [
[
1,
0
]
],
"minimum_comparators": 1,
"count": 1
}
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden