Information AboutComputationally Expensive |
| CATEGORIES ABOUT COMPUTATIONALLY EXPENSIVE | |
| computational complexity theory | |
|
For some expensive algorithms, there are less expensive counterparts. A traditional example in which multiple algorithms exist to achieve the same end is the class of Sorting Algorithm s used to order a one-dimensional List . From the point of view of implementation, the so-called Bubble Sort is one of the simplest of these algorithms. It is, however, relatively computationally expensive, requiring more computation steps for a list of given size than almost any other standard algorithm. As such, bubble sort is virtually never used in practice. For real-life sorting problems, much more efficient algorithms are used, such as Quicksort ; these, however, are somewhat more complicated in their implementation. Often, the more general an algorithm, the more computationally expensive it is. For example, algorithms used for manipulating a generic Matrix will work on a Sparse Matrix , but algorithms designed specifically for sparse matrices will be less expensive. |
|
|