Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Insertion sort requires insertion of an element in sorted order by
shifting the elements of an already sorted list while implemented
through array. If instead of using arrays, we use doubly linked-list,
what would be the time complexity?
Time Complexity Comes out to be O(n^2)? Why?
If we consider insertion for n elements then it will be
log(1) + log(2) + log(3) + ….. + log(n) – n times for n elements
hence complexity should be O(nlogn)
Insertion into a linked list takes time O(n), not O(lg n), because you have to navigate the link structure to find the insertion point.