Anonymous user
Talk:Longest string challenge: Difference between revisions
→Use only integers and strings: J and getting to the real intent
(→Use only integers and strings: J and getting to the real intent) |
|||
Line 90:
::::: Part 2: what is a "comparison operator"? (I have no clue what is being restricted here.)
::::: Part 3: what is a data type? (See part 1). --[[User:Rdm|Rdm]] 20:16, 14 August 2011 (UTC)
:::::: Ok, lets start with my intent was not to rule out J. You also might want to look at the (currently) last paragraph under Restrictions (search for "boring and pedestrian") and see that I'm thinking that the task needs to be specified more positively. Toward that end, I'd appreciate your input. I also appreciate that J (and APL and others) are sufficiently different in approach that there are creative approaches that would be different from other languages and also that you may very well be correct that it doesn't make much sense. The pedestrian solution is to loop through the input building a list/array of the longest strings testing length using gt/lt. J rarely does things in such a pedestrian and serial manner.
:::::: Re Pt1 and 3. I thought J had types inside arrays like numbers and literals. I also thought J had operators for dealing with literals that were not generalized to arbitrary dimensioned arrays.
:::::: Re Pt2. Stepping back this seems to be focusing on avoiding direct comparison of length as in the pedestrian solution. Most of the posted solutions are looking at some secondary way of detecting end of string.
:::::: Does any of that help? As a start? --[[User:Dgamey|Dgamey]] 21:45, 14 August 2011 (UTC)
== Not pointless ==
| |||