From 6ebe5c3c2bfe2d491a4e7a41fb902f252f7f7ffe Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Manuel=20Gij=C3=B3n=20Agudo?= Date: Mon, 20 Sep 2021 23:52:30 +0200 Subject: [PATCH 1/3] README.md updated --- README.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/README.md b/README.md index 6d87e7f..b5e20dd 100644 --- a/README.md +++ b/README.md @@ -41,6 +41,10 @@ python script.py * : +``` +Rscript script.R +``` + * : In case some flag is needed for the compiler, will be indicated in the script. From bdb0cd489043c8f6916b9a9b40aa99fe070408b6 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Manuel=20Gij=C3=B3n=20Agudo?= Date: Tue, 23 Nov 2021 12:23:51 +0100 Subject: [PATCH 2/3] Linear Search in R --- Algorithms/Searching/linearSearch.R | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 Algorithms/Searching/linearSearch.R diff --git a/Algorithms/Searching/linearSearch.R b/Algorithms/Searching/linearSearch.R new file mode 100644 index 0000000..3d53c42 --- /dev/null +++ b/Algorithms/Searching/linearSearch.R @@ -0,0 +1,25 @@ +# Linear Search R implementation. O(n). +LinearSearch <- function (elements, x){ + # elements : vector with the elements + # x : element to be found + if (length(elements)!= 0){ + for (i in 1:length(elements)){ + if (elements[i] == x){ + return(i) + } + } + } + return(-1) +} + +elements <- c(1, 3, 4, 5, 6, 8, 23, 43, 44, 45) +x <- 23 + +position <- LinearSearch(elements, x) + +if (position[1] == -1){ + print("The element has not been found") +} else { + sprintf("The element has been fount at position %d", position + 1) +} + From 892409ad8a09095e1375366c26bb3ec28f6219dc Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Manuel=20Gij=C3=B3n=20Agudo?= Date: Tue, 23 Nov 2021 12:35:50 +0100 Subject: [PATCH 3/3] READMEs updated --- Algorithms/README.md | 3 ++- README.md | 1 + 2 files changed, 3 insertions(+), 1 deletion(-) diff --git a/Algorithms/README.md b/Algorithms/README.md index 14fc2b1..47ae746 100644 --- a/Algorithms/README.md +++ b/Algorithms/README.md @@ -15,7 +15,7 @@ | Algorithm | Complexity | Implementations | | --- | --- | --- | -| [Linear Search](#LinearSearch) | O(n) | | +| [Linear Search](#LinearSearch) | O(n) | 8| | [Binary Search](#BinarySearch) | Theta(logn) | | | [Ternary Search](#TernarySearch) | Theta(logn) | | | [Jump Search](#JumpSearch) | O(sqrt(n)) | | @@ -353,6 +353,7 @@