File:Bloodwar.jpg

Summary

Blood War Booster Pack

Licensing

This image is copywritten, the copyright for which is held by Wizards of the Coast. It is believed that its use here constitutes Fair Use because it adheres to one or more of the following criteria:

it is being used “…for purposes such as criticism, comment, news reporting, teaching (including multiple copies for classroom use), scholarship, or research…”
it is a small and/or insubstantial portion of the work.
its use is transformative.
it is used in a non-commercial setting, and therefore is not being used to generate profit in this context.
its use here does not significantly impede the right of the copyright holder to sell the copyrighted material.

We ask you to please add the {{needsadmin}} template if there is a violation to this disclaimer within this page.

gollark: I actually stole this particular quicksort from a r/haskell post talking about it.

gollark: ```lisp (let (partition_rec xs pred acc) (cond ((= xs '()) acc) (true (partition_rec (tail xs) pred (cond ((pred (head xs)) (list (cons (head xs) (head acc)) (snd acc))) (true (list (head acc) (cons (head xs) (snd acc)))) ))) )) (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```These all have to be done tail recursively or it could overflow.

gollark: Continuation passing style quicksort in a hilariously slow interpreter.

gollark: It manages *1* second, which is great.

gollark: When writing osmarkslisp™, I cared about performance to the extent that it would sort a list of 200 integers in under 5 seconds.

This article is issued from Dandwiki. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.