We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Let Discuss here

Lecture 11-22 of

CS502 Fundamentals of Algorithms

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

See Your Saved Posts Timeline

Views: 195


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

All Fellows please discuss here about these lectures. Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning.

What is sorting? Define slow sorting algorithms. Marks 5

Assalam O Alaikum,

pivot number kasy find kerty hain ya khud sy set kerna hota hai ya koi logic use hu ga

pls koi baty ga???

yeh theta (n log n) time ka kia matlab hai ?? sir iss ko lecture main strong show kerty hain means iss ka use


theta ( n2) ka ?? aur iss ko sir run time main worst kehty hain pls explain  

in dono main kia different hai ??

best tu wo iss ko kehty hain theta(n log n) ko

 theta ( n2) ki nisbat 

pls koi detail main explain kery ga 

pls mujy samj nahi aa raha yeh 


© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service