Replies: 1 comment
-
Hi Sushant,
I don't have any measured data or complexity analysis. The complexity of the data structures used is well known and sglib implements them in a standard way. In other words:
Concerning sorting algorithms, sglib provides quicksort and heapsort for arrays and mergesort for linked lists. Quicksort has the worst case performance O(n^2), heapsort and mergesort both have the worst case complexity O(n * log n). I hope this answers your question, Marian |
Beta Was this translation helpful? Give feedback.
-
Hi Marian,
First of all, thanks for this header based project.
Can i get some data from performance & complexity analysis done on the project. Like how much time sglib takes for addition, deletion, search & delete for say N no. of data records.
Also, does all the complexities of algorithms in sglib concides with standard complexities of data structures.
Thanks,
Sushant Gaurav
Beta Was this translation helpful? Give feedback.
All reactions