kaist-cp/cs500

Codes of systolic array, odd-even sort, and bitonic sort

Closed this issue · 5 comments

ppnchb commented

https://gist.github.com/ppnchb/33cf1bbf0bea325f1a2b3998af971bd4

I tried to implement these 3 algorithms with python and here's the result.
Systolic array is just a direct translation from pseudocode in the lecture note to python, and others are added with proper sort algorithm using given merge algorithm in the lecture note.
I think it works OK, but who knows. If you find any mistake, please share.
I hope it can give you better understanding on course materials, as I did while writing.

BoSamothrace commented

Ohhh. Thank you very much~

jeehoonkang commented

Thank you so much. Your contribution is invaluable to us all. May I ask if I can use the code for the next semesters?

CauchyComplete commented

Wow I[0,j] = X[k-j, j] if 0 <= k - j < l else 0 I didn't know this works

jeehoonkang commented

At this stage of the semester, I'd like to close tech-related issues.