Joined
Last Seen
-4 Reputation Points
- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
60% Quality Score
- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
0 Endorsements
Ranked #107.40K
~207 People Reached
Favorite Forums
Computer Science
x
1
|
I am trying to figure out the time complexity for a best case scenario shell sort. I know worst case is O(n^2) and I think best case should be O(n^2) as well because even thought its already sorted it still has to break the array down into gaps and check …
|