Content deleted Content added
m SwisterTwister moved page Draft:Input Enhancement (Computer Science) to Input Enhancement (Computer Science): Publishing accepted Articles for creation submission (AFCH 0.9) |
Cleaning up accepted Articles for creation submission (AFCH 0.9) |
||
Line 1:
In [[computer science]], '''input enhancement''' is the principle that processing a given input to a problem and altering it in a specific way will increase [[Time_complexity |runtime efficiency]] or [[DSPACE |space efficiency]], or both. The altered input is usually stored and accessed to simplify the problem. This is done by exploiting the structure and properties of the inputs to create various speed-ups in the efficiency of the [[algorithm]].
Line 15 ⟶ 14:
'''return false'''
'''return true'''
Without a presort, at worst case, this algorithm would require every element to be checked against every other element with two possible outcomes: either there is no duplicate element in the array, or the last two elements in the array are the duplicates. This results in a O(''n''<sup>2</sup>) efficiency.
Line 93 ⟶ 91:
==References==
* Levitin, Anany (2012). ''Introduction to The Design & Analysis of Algorithms'' (Third Edition). Pearson. ISBN 978-0-13-231681-1
[[Category:Computer science]]
| |||