Rev | Line | |
---|
[37] | 1 | % demonstrates the difference in speed between sorted and non-sorted set
|
---|
| 2 | % operations.
|
---|
| 3 |
|
---|
| 4 | tim = [];
|
---|
| 5 | for iter = 1:100
|
---|
| 6 | a = 1:10;
|
---|
| 7 | s = 1:1000;
|
---|
| 8 | tic;for iter2=1:100;tf1=ismember(a,s);end;tim(1,iter)=toc;
|
---|
| 9 | tic;for iter2=1:100;tf=ismember_sorted(a,s);end;tim(2,iter)=toc;
|
---|
| 10 | assert(all(tf==tf1));
|
---|
| 11 |
|
---|
| 12 | tic;for iter2=1:100;tf1=setdiff(a,s);end;tim(3,iter)=toc;
|
---|
| 13 | tic;for iter2=1:100;tf=setdiff_sorted(a,s);end;tim(4,iter)=toc;
|
---|
| 14 | assert(all(tf==tf1));
|
---|
| 15 | end
|
---|
| 16 | tim = row_sum(tim);
|
---|
| 17 | fprintf(' ismember: %gs\nismember_sorted: %gs (%g times faster)\n setdiff: %gs\nsetdiff_sorted: %gs (%g times faster)\n',[tim(1) tim(2) tim(1)/tim(2) tim(3) tim(4) tim(3)/tim(4)]);
|
---|
Note: See
TracBrowser
for help on using the repository browser.