gistfile1.md

Packet fill algorithm

P := largest packet
while (true)
  while (P overflows)
    send part
  append P
  while (exists packets that won't overflow)
    append largest of them
  if (exists packets that would be less fragmented if started here)
    P := largest of them
  else
    send
    if (no more packets)
      break
    else
      P := largest packet

hello

this is nice code thank mr skeltal