L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

[Musicalnikk]

Abki baar semester start se hi padh rha hu, 🤣🤣

[vibhor]

BInary search-- BEST CASE = 0(1), when the desired element is at the middle.

[suyashrajsinghrathore]

Mera 10 min baad paper h or mene sirf ye video dekha h ab bhagwan bharose result aayega

[natesh]

Excellent sum up. But there is a mistake. Heap construction in bottom up approach takes O(2n) or O(n) time itself. Please see the analysis. Insertion deletion and lookup take logn time.

[shawnidutta]

This video is really really helpful. I follow your lectures regularly. Please start start topics which are important for Ugc net exam like data mining, artificial intelligence etc. It will be a great help. Thanks in advance sir.

[jalaanchal]

The time complexity of constructing a heap is O(n), not O(nlog n).

[Raj-yjfk]

In case of bubble sort, if list is already sorted then we confirm in 1st pass all element are their proper place so best case complexity should be O(n) not O(n^2)

[rohitkasture]

Best case time complexity of Bubble sort is O(n).
The main advantage of Bubble Sort is the simplicity of the algorithm. The space complexity for Bubble Sort is O(1), because only a single additional memory space is required i.e. for temp variable. Also, the best case time complexity will be O(n), it is when the list is already sorted.

[ekta]

Thnk u so mch for making this separate playlist for revision...

[jiya]

please sir can you make full description video on sorting... please

[krutikpatel]

CORRECTION
Bubble Sort has O(n) Time in best case when array is already sorted.

Great lecture I have found on this topic.
It really helps me a lot.
😊

[vivekmodi]

Sir pls upload another lectures of DAA quickly exams are coming.

[Ranisvlogs]

Hi Sir, Thank you for this video. Sir If you can manage can you please upload a course of D&A of Algorithm. I shall be very thankfull.

[ahmadfaizan]

Correction:
In binary search, in best case the first element would be found in the middle not on the first position

[arjumandayoub]

I have a doubt why are we using O to denote for the worst, average and best time complexities of the algorithm .I thought it is used to denote the worst time complexity only .I understand for the cases in which some cases have the same time complexity for but when atleast one or all cases have different time complexities then why aren't we using omega to denote the best and theta to denote the average time complexity?

[dd]

all there lectures are of very short time duration but these are only to learn those things by swallowing as tablets. nothing is understandable at all!

[sumanmaiti]

Bubble sort best case complexity O(n) not O(n^2)

[artisharma-ixcf]

Thank u sir...plzzz make a video on important topics of DS for NET as soon as possible sir

[ashutoshpandey]

Correction:
Prims and kruskal's algorithms are used to find minimum spanning tree not shortest distance

[reyazalam]

Thank u so much u r a genius
Plz make more last moment videos series for all topics 😊...
Again thanks a lot...