Scribd
Upload
18 views

Esdat Unit 2 Activity 2

The document discusses sorting and search methods for arrays. It describes bubble sort and merge sort algorithms for sorting arrays, noting that bubble sort is better for smaller arrays while merge sort scales well for larger arrays. For searching arrays, it covers linear search, which iterates through each element, and binary search, which works by narrowing the search space in a sorted array until the target is found. Images provide visual examples of the key concepts discussed.

Uploaded by

irving.cardenas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views

Esdat Unit 2 Activity 2

The document discusses sorting and search methods for arrays. It describes bubble sort and merge sort algorithms for sorting arrays, noting that bubble sort is better for smaller arrays while merge sort scales well for larger arrays. For searching arrays, it covers linear search, which iterates through each element, and binary search, which works by narrowing the search space in a sorted array until the target is found. Images provide visual examples of the key concepts discussed.

Uploaded by

irving.cardenas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

“ESDAT UNIT 2 ACTIVITY 2”

REPORTE DE ESTADÍA PARA OBTENER EL


TÍTULO DE:

TÉCNICO SUPERIOR UNIVERSITARIO EN

TECNOLOGÍAS DE LA INFORMACIÓN

DESARROLLO DE SOFWARE MULTIPLATAFORMA

PRESENTA:

IRVING DANIEL CARDENAS


CABRERA
CD. REYNOSA, TAMAULIPAS ENERO 2024.

Contenido
Sorting Methods in Arrays:...................................................................................3

Concept:........................................................................................................... 3

Application:.......................................................................................................3

Concept:........................................................................................................... 3

Application:.......................................................................................................3

Search Methods in Arrays:...................................................................................4

Concept:........................................................................................................... 4

Application:.......................................................................................................4

Concept:........................................................................................................... 4

Application:.......................................................................................................4

Imagen 1 Introduction.......................................................................................... 3
Imagen 2 Introduction 2....................................................................................... 3
Imagen 3 Desarrollo.............................................................................................4
Imagen 4 Desarrollo 2..........................................................................................4
Introduction.
Sorting Methods in Arrays:
Concept: Bubble Sort is a simple sorting algorithm that repeatedly steps
through the list, compares adjacent elements, and swaps them if they are in the
wrong order. The pass through the list is repeated until the list is sorted.

Application: It's suitable for small datasets but less efficient for large datasets.

Imagen 1 Introduction

Concept: Merge Sort is a divide and conquer algorithm that divides the input
array into two halves, recursively sorts each half, and then merges the sorted
halves.

Application: It's more efficient than Bubble Sort for larger datasets and is a
stable sorting algorithm.

Imagen 2 Introduction 2
Search Methods in Arrays:
Concept: Linear Search is a simple search algorithm that iterates through each
element in the array until the target element is found or the end of the array is
reached.

Application: Suitable for small-sized arrays or unordered lists.

Imagen 3 Desarrollo

Concept: Binary Search is an efficient search algorithm for sorted arrays. It


compares the target value to the middle element of the array and continues
narrowing down the search space until the target is found or the search space is
empty.

Application: Efficient for large-sized sorted arrays.

Imagen 4 Desarrollo 2

You might also like