Models of Computation

This course provides the tools for analysing the running time of any algorithm. It also compare and analyse the recursive algorithms.  Divide and conquer approach is also included.

Prepare for UGC NET 2019 by watching our free online lessons covering UGC Net syllabus and also helping you solve Previous year question papers. Pursue your dream of JRF.

NTA-UGC-NET & SET Exams

English

Recurrence a Tool for Algorithm Analysis: NTA-UGC NET

Algorithms

Computer Science & Application

NET Exams

This lesson covers all the details of quick sort. The working of quick sort is explained with an example. The best case and worst case running time of an algorithm is also discussed.

Please Login To Continue

Quick Sort

Poonam

Recurrence a Tool for Algorithm Analysis: NTA-UGC NET

1

2

3

4

5

Crack NTA-UGC-NET & SET Exams with Unacademy

Get subscription and access unlimited live and recorded courses from India's best educators

Structured syllabus

Daily live classes

Ask doubts

Tests & practice