Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both 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]
fangfufu [Sorting individual buckets using insertion sort]
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>​
 //​Uncollapsed barcodes, they became a bit unwieldy to shuffle around. // //​Uncollapsed barcodes, they became a bit unwieldy to shuffle around. //
 +
 +{{:​public:​parkrun:​20181225_102455.jpg?​400}}
 </​WRAP>​ </​WRAP>​
  
-{{ :​public:​parkrun:​20181225_102455.jpg?​400 |}} 
 <​newcolumn>​ <​newcolumn>​
 <WRAP centeralign>​ <WRAP centeralign>​
-//Partially collapsed clusters of consecutive barcodes, it was much easier to perform insertion. // +//Partially collapsed clusters of consecutive barcodes, ​this made it much easier to perform insertion. //
-</​WRAP>​+
  
-{{ :​public:​parkrun:​20181225_103446.jpg?​400 ​|}}+{{:​public:​parkrun:​20181225_103446.jpg?​400}} 
 +</​WRAP>​
 </​columns>​ </​columns>​
  
  • public/how_parkrun_volunteers_sort_barcodes_-_a_computer_scientist_s_perspective.txt
  • Last modified: 2018/12/28 11:23
  • by fangfufu