public:how_parkrun_volunteers_sort_barcodes_-_a_computer_scientist_s_perspective
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
public:how_parkrun_volunteers_sort_barcodes_-_a_computer_scientist_s_perspective [2018/12/28 03:47] – fangfufu | public:how_parkrun_volunteers_sort_barcodes_-_a_computer_scientist_s_perspective [2018/12/28 11:17] – [Sorting individual buckets using insertion sort] fangfufu | ||
---|---|---|---|
Line 98: | Line 98: | ||
However there are some physical optimisation which I made. I collapsed consecutive sorted barcodes into clusters. This is because physically inserting a barcode involves moving all the adjacent barcodes, which takes quite a bit of effort on a rough surface. The two figures below illustrate what I meant: | However there are some physical optimisation which I made. I collapsed consecutive sorted barcodes into clusters. This is because physically inserting a barcode involves moving all the adjacent barcodes, which takes quite a bit of effort on a rough surface. The two figures below illustrate what I meant: | ||
- | <columns 100% - - > | + | <columns 100% 50% 50% > |
<WRAP centeralign> | <WRAP centeralign> | ||
// | // | ||
+ | |||
+ | {{: | ||
</ | </ | ||
- | {{ : | ||
< | < | ||
<WRAP centeralign> | <WRAP centeralign> | ||
- | //Partially collapsed clusters of consecutive barcodes, it was much easier to perform insertion. // | + | //Partially collapsed clusters of consecutive barcodes, |
- | </ | + | |
- | {{ : | + | {{: |
+ | </ | ||
</ | </ | ||
public/how_parkrun_volunteers_sort_barcodes_-_a_computer_scientist_s_perspective.txt · Last modified: 2018/12/28 11:23 by fangfufu