Endpoint · researchPOSTdatenvertrag.halowerk.com /v1/minimum-sorting-network-family
For a supplied wire count n0..4, synthesize EVERY minimum-COMPARATOR fixed sorting network.
Read more
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.Overview
Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.003 per call
Paid calls
none yet
delivery unknown until someone pays
More info
Seller?
URL
https://datenvertrag.halowerk.com/v1/minimum-sorting-network-family
Seen
first 12 days ago · last 4 days ago
20 free handshakes
Payment
Pays through
x402
Offered on?
Base USDC
Listed on?
Base
Paid calls
No paid calls yet.
Delivery is unknown until someone pays. A handshake only shows it asks for payment.
Verify it yourself
npx teppi-check https://datenvertrag.halowerk.com/v1/minimum-sorting-network-familycurl -s https://api.teppi.xyz/v1/trust/cap_01M6RBZPMXSGJ4ZV4YK2D5Q27X