Assignment2 #30
Open
Assignment2 #30
Conversation
This file contains 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
|
5 minutes late. I'll grade this, but… |
pragdave
reviewed
Sep 21, 2016
| sum2a = your_anonymous_function(1, 2) | ||
| #sum2a = your_anonymous_function(1, 2) | ||
|
|
||
| sum2a = fn(a, b) -> a + b end |
| sum2b = your_anonymous_function(1, 2) | ||
| #sum2b = your_anonymous_function(1, 2) | ||
|
|
||
| sum2b = &(&1 + &2) |
| sum3a = your_anonymous_function(1, 2, 3) | ||
| #sum3a = your_anonymous_function(1, 2, 3) | ||
|
|
||
| sum3a = fn(a, b, c) -> sum2a.(a, sum2a.(b,c)) end |
| sum3b = your_anonymous_function | ||
| #sum3b = your_anonymous_function | ||
|
|
||
| sum3b = &(sum2b.(&1, sum2b.(&2, &3))) |
| create_adder = your_anonymous_function(1) | ||
| #create_adder = your_anonymous_function(1) | ||
|
|
||
| create_adder = fn(x) -> (fn(y) -> x + y end) end |
|
|
||
| #def list_equal . . . "your code" | ||
|
|
||
| def list_equal([],[]) do true end |
There was a problem hiding this comment.
4
Same comment here. On line 130, you could test the two heads are equal with
def list_equal([h|t1], [h|t2]), do: list_equal(t1, t2)
def list_equal(_, _), do: false| @@ -149,7 +180,43 @@ defmodule Ex03 do | |||
| Think a little about a nice way to lay this code out. | |||
| """ | |||
|
|
|||
| def won . . . "your code" | |||
| #def won . . . "your code" | |||
There was a problem hiding this comment.
0
You were on the right track. Here's my solution:
def won(position) do
case position do
{ a, a, a,
_, _, _,
_, _, _ } -> a
{ _, _, _,
a, a, a,
_, _, _ } -> a
{ _, _, _,
_, _, _,
a, a, a } -> a
{ a, _, _,
a, _, _,
a, _, _ } -> a
{ _, a, _,
_, a, _,
_, a, _ } -> a
{ _, _, a,
_, _, a,
_, _, a } -> a
{ a, _, _,
_, a, _,
_, _, a } -> a
{ _, _, a,
_, a, _,
a, _, _ } -> a
_ -> false
end
end| def reverse . . . "your code" | ||
| #def reverse . . . "your code" | ||
|
|
||
| def reverse(list), do: reduce(list, [], &[&1 | &2]) |
| def min . . . "your code" | ||
| #def min . . . "your code" | ||
|
|
||
| def min(list), do: reduce(list, &(if &1 < &2 do &1 else &2 end)) |
| def even_odd . . . "your code" | ||
|
|
||
|
|
||
| #def even_odd . . . "your code" |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Cary Humphries
47237948