0
I’m using the Strand Sort to do a college job and wanted to know if at level of complexity, in worst case it O(n 2). and I wanted to know under what circumstances it would be better to use this ordination and why ?
0No answers
Browser other questions tagged list algorithm performance classification
You are not signed in. Login or sign up in order to post.
This algorithm is best used in Linked lists, because as the algorithm produces a lot of resampling if applied in vectors the time complexity increases due to the insertions. The worst case (time complexity) occurs when applied to decreasing ordered vectors.
– Augusto Vasques