-
-
Notifications
You must be signed in to change notification settings - Fork 318
London | 26-ITP-May | Edina Kurdi | Sprint 1 | coursework-Data-Groups #1280
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
edinakurdi
wants to merge
8
commits into
CodeYourFuture:main
Choose a base branch
from
edinakurdi:coursework/sprint-1
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
8 commits
Select commit
Hold shift + click to select a range
6c751a1
fix implementation of median function based on jest tests
edinakurdi d165c4f
implement function to find the maximum value
edinakurdi 678964f
implement testing for function for maximum
edinakurdi 5e9a9fb
implement sum function
edinakurdi fd35449
write tests for sum function
edinakurdi cf98ba8
implement deduplicating function
edinakurdi b51bc9d
write tests for deduplicating function
edinakurdi 5e42552
refactor includes function
edinakurdi File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1 +1,17 @@ | ||
| function dedupe() {} | ||
| function dedupe(array) { | ||
| //create a duplicate,to avoid changing the array | ||
| const copiedArray = Array.from(array); | ||
|
|
||
| //Initialise an empty array (to collect non-duplicates in) | ||
| const dedupedArray = []; | ||
|
|
||
| //create a for loop to collect non-duplicates | ||
| for (element of copiedArray) { | ||
| if (!dedupedArray.includes(element)) { | ||
| dedupedArray.push(element); | ||
| } | ||
| } | ||
| return dedupedArray; | ||
| } | ||
|
|
||
| module.exports = dedupe; | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,4 +1,10 @@ | ||
| function findMax(elements) { | ||
| // filter out non-number items from elements | ||
| elements = elements.filter((element) => typeof element === "number"); | ||
|
|
||
| // find maximum | ||
| const max = Math.max(...elements); | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Can you implement this without using built-in max? |
||
| return max; | ||
| } | ||
|
|
||
| module.exports = findMax; | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,4 +1,17 @@ | ||
| function sum(elements) { | ||
| //filter out non-numbers | ||
| elements = elements.filter((element) => typeof element === "number"); | ||
|
|
||
| // initialise a sum total | ||
| total = 0; | ||
|
|
||
| // loop through the elements of the array and add each to the total | ||
| for (let i = 0; i < elements.length; i++) { | ||
| total = total + elements[i]; | ||
| } | ||
|
|
||
| // finally return the total | ||
| return total; | ||
| } | ||
|
|
||
| module.exports = sum; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,13 +1,21 @@ | ||
| // Refactor the implementation of includes to use a for...of loop | ||
|
|
||
| // function includes(list, target) { | ||
| // for (let index = 0; index < list.length; index++) { | ||
| // const element = list[index]; | ||
| // if (element === target) { | ||
| // return true; | ||
| // } | ||
| // } | ||
| // return false; | ||
| // } | ||
|
|
||
| function includes(list, target) { | ||
| for (let index = 0; index < list.length; index++) { | ||
| const element = list[index]; | ||
| for (element of list) { | ||
| if (element === target) { | ||
| return true; | ||
| } | ||
| } | ||
| return false; | ||
| } | ||
|
|
||
| module.exports = includes; |
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Do you need a copy of the array here?