Reputation
51,224
Next tag badge:
251/100 score
19/20 answers
Badges
6 82 199
Newest
 Good Answer
Impact
~681k people reached

May
21
comment Extract a list of all built-in functions used in a notebook
Nice. I forgot about Cells...
May
21
answered Extract a list of all built-in functions used in a notebook
May
21
comment Get subgraphs: communities of graph g
FYI you can use the notation 1 <-> 2 for undirected edge.
May
21
comment A fast way to compare interval
Finally, I note that this solution relies on checking interval intersections only between adjacent list elements. So for example Tentative7[{{1, 10}, {2, 4}, {6, 8}}] returns {2} instead of {2, 3}. Is this the intended behaviour?
May
21
comment A fast way to compare interval
Secondly, your GIMQ function may be more succinctly written as GIMQ[{{a_, b_}, {c_, d_}}] := a <= c && b >= d
May
21
comment A fast way to compare interval
A couple of points - firstly please be aware that List is a terrible choice of variable name (as you used in LIP) because it is the symbol used by Mathematica as the head of lists. While it doesn't cause any problem here, it is generally good practice to avoid using built-in symbol names for your own variables.
May
21
comment A fast way to compare interval
I'm surprised you find Rasher's and my solutions so slow on a list of length 2000. For me they both take a fraction of a second. Perhaps your ListT is not a packed array. Try evaluating ListT = Developer`ToPackedArray[ListT]; and run the benchmarks again.
May
20
reviewed Close can I evaluate multiple cells at the same time?
May
20
reviewed Close Using a web-crawler to search website for occurrences of keywords
May
20
comment Building adjacency matrix from set data
In your example you have a unique symbol for each player and game. When you have thousands of players do you intend to use thousands of symbols? Does the actual data consist of hundreds of expressions like g1 = {p1, p3, p5} ?
May
20
answered A fast way to compare interval
May
19
comment How to do memoization together with evaluation of a complicated function
Oops, sorry, missed that. Maybe Function instead: (f[x_] := f[x] = #) &[test[x]]
May
19
comment How to do memoization together with evaluation of a complicated function
How about With[{t = test[x]}, f[x_] := f[x] = t]
May
19
comment A fast way to compare interval
It is still not clear. Please could you include what the result should be for your example ListT and check that the posted code actually generates that result.
May
19
awarded  Nice Answer
May
19
comment How to optimize my code?
Is it necessary to use exact arithmetic? For example try using 20.0 as the radius. By the way you did not include a definition for coordinateList so your code does not run.
May
18
awarded  Nice Question
May
17
reviewed Close Plot Series output?
May
17
comment Exp is slower for some number ranges
It appears that Exp[I x] slows down for Abs[x] >= 512. The transition is clearer like this: w = ConstantArray[N[I], {5000000}]; t = Table[{n, Timing[Exp[n w]][[1]]}, {n, 510, 514, 0.1}]
May
15
comment How do you add options to a function that is being mapped?
I edited this answer slightly as I felt it was misleading to say that you need to use a pure function.