Insertion sort in Haskell


/ Published in: Other
Save to your folder(s)



Copy this code and paste it in your HTML
  1. import List
  2. insort l = foldl (flip insert) [] l

Report this snippet


Comments


You need to login to view comments.