#1
23rd August 2012, 03:31 PM
| |||
| |||
IIT Kharagpur Lecture Notes
I am student of Indian institute of technology Kharagpur and I want to do download its lecture notes PDF File from net so please tell m e from which website I can do download its PDF file
|
#2
24th August 2012, 05:12 PM
| |||
| |||
Re: IIT Kharagpur Lecture Notes
You are the student of Indian institute of technology Kharagpur and you want to do download its lecture notes in PDF File so I am uploading file here you can see lecture notes on Design & Analysis of Algorithms of G P Raja Sekhar Department of Mathematics I I T Kharagpur like that: BUBBLE SORT The bubble sort is the oldest and simplest sort in use. The bubble sort works by comparing each item in the list with the item next to it, and swapping them if required. The algorithm repeats this process until it makes a pass all the way through the list without swapping any items. This causes larger values to "bubble" to the end of the list while smaller values "sink" towards the beginning of the list. Pros: 1) Simplicity and ease of implementation. 2) Auxiliary Space used is O (1). Cons: 1) Very inefficient. General complexity is O (n2). Best case complexity is O(n). You can also see video for the Optimal Control on following link; freevideolectures.com/Course/3081/Optimal-Control |