is callsub add a lot of overhead?

[melamoud]

I'm trying to make a generic sorting algorithm , and i need a compare callback method, my quicksort without the call for the compare takes 3 ms with it it take 150ms is that make sense ?
my compareValue sub is as simple as it can be (compare two int) but I do cast it from object to int - maybe that add something

anyone ?

 

[thedesolatesoul]

its hard to tell without seeing the code, but you can experiment with an empty callsub and see how long that takes.

 

[Erel]

CallSub does add some overhead. Can you post your code?

 

[melamoud]

here it is,

to see the callback overhead press quick sort and quicksortCB (you need to randomize in between)
to see the stackoverflow press same value and quicksort

the code is a mess (just testing code) sorry about that

 

[Erel]

Note that you should use File - Export as zip when uploading projects.

The overhead you see is probably from CallSub (which can be called many times during a sort).

I recommend you to use an approach similar to the one I posted in the other thread, or use a SQL database.

 

[melamoud]

I was trying (for fun not really need it) to generalize the sorting algorithm, basically have the developer build a list or array of objects and only he knows how to compare the values, this can not be done without call sub right ?
(until b4a will support more OOP attributes)

 

[Erel]

Yes, you need CallSub for that.