Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion index.html
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ <h1 id="encabezado">Ejercicios </h1>
</ul>


<script src="./js/main.js"></script>
<script src="/js/main.js"></script>
<script src="https://cdn.jsdelivr.net/npm/jquery@3.5.1/dist/jquery.slim.min.js" integrity="sha384-DfXdz2htPH0lsSSs5nCTpuj/zy4C+OGpamoFVy38MVBnE+IbbVYUew+OrCXaRkfj" crossorigin="anonymous"></script>
<script src="https://cdn.jsdelivr.net/npm/bootstrap@4.6.1/dist/js/bootstrap.bundle.min.js" integrity="sha384-fQybjgWLrvvRgtW6bFlB7jaZrFsaBXjsOMm/tB9LTS58ONXgqbR9W8oWht/amnpF" crossorigin="anonymous"></script>
</body>
Expand Down
20 changes: 20 additions & 0 deletions js/main.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
// ## Ejercicio #2
// María llega a su entrevista de trabajo para el rol de Desarrollador Junior y se le pide que resuelva este problema:
// Dada una lista de números [-1, 3, 4, 2, 6], escribe una función en javascript para calcular el número más pequeño.



function MyMin(nums) {
var n = nums.length;
minimo = nums[n-1];
while (n--){
if(nums[n] < minimo) {
minimo = nums[n]
}
}
return minimo;
};

var nums = [-1, 3, 4, 2, 6];
var m = MyMin(nums);
console.log(m)