Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |
| courses:cs211:winter2012:journals:jeanpaul:chapter2section1 [2012/01/18 02:45] – mugabej | courses:cs211:winter2012:journals:jeanpaul:chapter2section1 [2012/01/18 02:46] (current) – mugabej |
|---|
| The question I have is: " Are running times of algorithms completely platform-independent or I got it wrong?What I mean is,if I run an algorithm on my PC,is it gonna run as quick as if I ran it on a supercomputer? I think algorithms run faster on supercomputers due the power of the processors and other design techniques of those supercomputers. Or the running time is all about the mathematical definition and doesn't care about the actual platform it is run at?". My best guess is that the supercomputers just add the speed at which the algorithms are processed,which is why I can't quite clearly see the difference between the mathematical definition of the running time and what actually happens in case of supercomputers.Or the running time is just how long it will take, not how how fast?Faster algorithms are always fast,but what about those algorithms that are not that fast?I think I the supercomputers just make those algorithms run faster thanks to their processors and the way they are designed. It's a bad thing the authors of the book didn't discuss that simple confusion that may arise though.\\ | The question I have is: " Are running times of algorithms completely platform-independent or I got it wrong?What I mean is,if I run an algorithm on my PC,is it gonna run as quick as if I ran it on a supercomputer? I think algorithms run faster on supercomputers due the power of the processors and other design techniques of those supercomputers. Or the running time is all about the mathematical definition and doesn't care about the actual platform it is run at?". My best guess is that the supercomputers just add the speed at which the algorithms are processed,which is why I can't quite clearly see the difference between the mathematical definition of the running time and what actually happens in case of supercomputers.Or the running time is just how long it will take, not how how fast?Faster algorithms are always fast,but what about those algorithms that are not that fast?I think I the supercomputers just make those algorithms run faster thanks to their processors and the way they are designed. It's a bad thing the authors of the book didn't discuss that simple confusion that may arise though.\\ |
| \\ | \\ |
| After rereading this section, I got the real meaning of the computational intractability, and realized the main reason why we have to describe the behavior of algorithms in terms of mathematical notations. Among other reasons, it's because it's easy to predict the behavior of the algorithm,and to be able to have a precise reference point to which compare your algorithm so you can see if it's as efficient as you can possibly think about.\\ | After rereading this section, I got the real meaning of the computational intractability, and realized the main reason why we have to describe the behavior of algorithms in terms of mathematical notations. Among other reasons, it's because it's easy to predict the behavior of the algorithms,and to be able to have a precise reference point to which compare your algorithm so you can see if it's as efficient as you can possibly think about.\\ |
| \\ | \\ |
| |
