Sorting Task

(Redirected from Data Sorting Task)
Jump to navigation Jump to search

A Sorting Task is a data processing task that sorts an item set to a permutation where neighboring members are in a specific ordered relation.



Further, the input data is often stored in an array, which allows random access, rather than a list, which only allows sequential access; though many algorithms can be applied to either type of data after suitable modification.

Sorting algorithms are often referred to as a word followed by the word "sort," and grammatically are used in English as noun phrases, for example in the sentence, "it is inefficient to use insertion sort on large lists," the phrase insertion sort refers to the insertion sort sorting algorithm.


  1. Scott, William A. (December 1962). “Cognitive complexity and cognitive flexibility". Sociometry. 25 (4): 405–414. doi:10.2307/2785779. JSTOR 2785779.
  2. Cooper-Kahn, Joyce; Dietzel, Laurie C. (2008). “What is executive functioning?". National Center for Learning Disabilities and WETA-TV. Archived from the original on September 20, 2014.
  3. Chelune, Gordon J.; Baer, Ruth A. (1986). “Developmental norms for the Wisconsin Card Sorting Test". Journal of Clinical and Experimental Neuropsychology. 8 (3): 219–228. doi:10.1080/01688638608401314. PMID 3722348.
  4. Boger-Mehall, Stephanie R. (1996). “Cognitive flexibility theory: implications for teaching and teacher education". Association for the Advancement of Computing in Education. pp. 991–993. Archived from the original on March 9, 2018. Retrieved November 18, 2012.
  5. Leber, A B; Turk-Browne N B; Chun M M (September 9, 2008). “Neural predictors of moment-to-moment fluctuations in cognitive flexibility". Proceedings of the National Academy of Sciences. 105 (36): 13592–7. doi:10.1073/pnas.0805423105. PMC 2527350. PMID 18757744.