Sorting and Selection

Descrição

Mapa Mental sobre Sorting and Selection, criado por Angelica Cordero em 22-05-2022.
Angelica Cordero
Mapa Mental por Angelica Cordero, atualizado more than 1 year ago
Angelica Cordero
Criado por Angelica Cordero mais de 3 anos atrás
4
0

Resumo de Recurso

Sorting and Selection
  1. Merge-Sort
    1. Divide-and-Conquer
      1. Divide (divide the input data into 2 or more disjoint subsets), conquer (recursively solve the subproblems), combine (merge the sorted sequences)
        1. Input sequences processed
          1. Output sequences generated
        2. Array-Based Implementation
          1. Implementation of recursive algorithm for Java array
          2. Running time
            1. Each node represents the time spent in a particular recursive call
              1. O(n log n)
              2. Alternative Implementations
                1. Sorting Linked Lists
                  1. A Bottom-Up (Nonrecursive) Merge-Sort