Insertion sort og selection sort Tölvunarfræði 2, vor 2012 Hallgrímur H. Gunnarsson Háskóli Íslands

Source URL: t2.hhg.to

A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri

Source URL: spcl.inf.ethz.ch

• Sorting algorithms
• Computing
• Data processing
• Mathematics
• Algorithm
• Mathematical logic
• Theoretical computer science
• Sorting
• Sort
• Computational complexity theory
• Program optimization
• Selection algorithm

A DESCRIPTIVE TITLE, NOT TOO GENERAL, NOT TOO LONG Markus P¨uschel Department of Computer Science ETH Z¨urich Z¨urich, Switzerland The hard page limit is 6 pages in this style. Do not reduce font size or use other tri

Source URL: spcl.inf.ethz.ch

• Sorting algorithms
• Computing
• Data processing
• Mathematics
• Algorithm
• Mathematical logic
• Theoretical computer science
• Sorting
• Sort
• Computational complexity theory
• Program optimization
• Selection algorithm

. CS711008Z Algorithm Design and Analysis Lecture 5. Basic algorithm design technique: Divide-and-Conquer 1

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Operations research
• Applied mathematics
• Computational complexity theory
• Algorithms
• Sorting algorithms
• Analysis of algorithms
• Divide and conquer algorithms
• Selection algorithm
• Time complexity
• Merge sort
• Fast Fourier transform

Knuth’s 0-1-Principle and Beyond Janis Voigtl¨ ander Technische Universit¨ at Dresden

Source URL: www.janis-voigtlaender.eu

• Sorting algorithms
• Order theory
• Mathematics
• Combinatorics
• Quicksort
• Sorting
• Merge sort
• Selection sort

Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009

Source URL: arxiv.org

• Sorting algorithms
• Analysis of algorithms
• External sorting
• Merge sort
• Algorithm
• Randomized algorithm
• Samplesort
• Selection algorithm
• In-place algorithm
• Time complexity
• The Art of Computer Programming
• Best
• worst and average case

Sorting and Selection on Dynamic Data∗ Aris Anagnostopoulos† Ravi Kumar‡ Mohammad Mahdian‡

Source URL: bioinfo.ict.ac.cn

• Analysis of algorithms
• Sorting algorithms
• Computational complexity theory
• Permutations
• Quicksort
• Science
• Selection algorithm
• FisherYates shuffle
• Algorithm
• Time complexity
• Sort
• Best
• worst and average case

Practical Massively Parallel Sorting – Basic Algorithmic Ideas Michael Axtmann, Timo Bingmann, Peter Sanders, and Christian Schulz arXiv:1410.6754v1 [cs.DS] 24 Oct 2014

Source URL: panthema.net

• Sorting algorithms
• Analysis of algorithms
• Computational complexity theory
• Quicksort
• Science
• Time complexity
• Selection algorithm
• Permutation
• Algorithm
• NP
• Samplesort
• Merge sort

Computer Science Education 2004, Vol. 14, No. 3, pp. 235–248 Teaching Algorithm Efficiency at CS1 Level: A Different Approach Judith Gal-Ezer, Tamar Vilner, and Ela Zur

Source URL: www.openu.ac.il

• Theoretical computer science
• Analysis of algorithms
• Dynamic programming
• Software optimization
• Algorithm
• Mathematical logic
• Selection algorithm
• Recursion
• Sort
• Best
• worst and average case
• Knapsack problem
• Matrix chain multiplication

Algorithm selection by rational metareasoning as a model of human strategy selection Falk Lieder Helen Wills Neuroscience Institute, UC Berkeley

Source URL: cocosci.berkeley.edu

• Sorting algorithms
• Order theory
• Mathematics
• Combinatorics
• Merge sort
• Selection algorithm
• Quicksort
• Insertion sort
• Algorithm
• Cocktail shaker sort
• Selection sort
• Heapsort