Contenido del Curso
Sorting Algorithms
Sorting Algorithms
Problem A
Swipe to show code editor
The task is to merge given sorted arrays arr1 and arr2. Do not use ready code from Merge Sort Algorithm.
How to merge: you have two sorted arrays arr1 and arr2, let’s set pointers p1 and p2 at the beginning of each of them (p1=0, p2=0).
Compare current values: if arr1[p1] < arr2[p2], then put arr1[p1] to temp and increase p1 by 1. Else do the same for p2.
If one of the pointers reaches max possible value (out of bounds), you can not check, and store all rest elements from another array.
Do the following until p1 < len(arr1) or p2 < len(arr2).
Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones¡Gracias por tus comentarios!
Problem A
Swipe to show code editor
The task is to merge given sorted arrays arr1 and arr2. Do not use ready code from Merge Sort Algorithm.
How to merge: you have two sorted arrays arr1 and arr2, let’s set pointers p1 and p2 at the beginning of each of them (p1=0, p2=0).
Compare current values: if arr1[p1] < arr2[p2], then put arr1[p1] to temp and increase p1 by 1. Else do the same for p2.
If one of the pointers reaches max possible value (out of bounds), you can not check, and store all rest elements from another array.
Do the following until p1 < len(arr1) or p2 < len(arr2).
Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones¡Gracias por tus comentarios!
Problem A
Swipe to show code editor
The task is to merge given sorted arrays arr1 and arr2. Do not use ready code from Merge Sort Algorithm.
How to merge: you have two sorted arrays arr1 and arr2, let’s set pointers p1 and p2 at the beginning of each of them (p1=0, p2=0).
Compare current values: if arr1[p1] < arr2[p2], then put arr1[p1] to temp and increase p1 by 1. Else do the same for p2.
If one of the pointers reaches max possible value (out of bounds), you can not check, and store all rest elements from another array.
Do the following until p1 < len(arr1) or p2 < len(arr2).
Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones¡Gracias por tus comentarios!
Swipe to show code editor
The task is to merge given sorted arrays arr1 and arr2. Do not use ready code from Merge Sort Algorithm.
How to merge: you have two sorted arrays arr1 and arr2, let’s set pointers p1 and p2 at the beginning of each of them (p1=0, p2=0).
Compare current values: if arr1[p1] < arr2[p2], then put arr1[p1] to temp and increase p1 by 1. Else do the same for p2.
If one of the pointers reaches max possible value (out of bounds), you can not check, and store all rest elements from another array.
Do the following until p1 < len(arr1) or p2 < len(arr2).
Cambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opcionesCambia al escritorio para practicar en el mundo realContinúe desde donde se encuentra utilizando una de las siguientes opciones