Information AboutComputationally Expensive |
| CATEGORIES ABOUT COMPUTATIONALLY EXPENSIVE | |
| computational complexity theory | |
|
At times, there is a more elegant, less expensive solution. A traditional example where there are many algorithms to achieve a uniform end are the Sorting Algorithms used on a one-dimensional List . One of the simplest to implement is the Bubble Sort . It is, however, more computationally expensive than the Quick Sort . Quick Sort , however, is more difficult (relatively) to implement. Often, the more general the solution, the more computationally expensive. 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. |
|
|