Simplest method in finding a Numeric Palindrome

[RavensFan]

So it is always possible to minimize any logic?  Really?

 How do you minimize this one?

 

[GerdW]

Hi RavensFan,

you were asking for this:

Two options :D:D:D

[Bob_Schor]

---

PriyadarsiniS wrote: Every single logic can be further minimized with LabVIEW, in that perspective.. it is always possible.

---

In my youth, I used a PDP-8 computer, with 4K of 12-bit memory organized in "pages" of 128 12-bit "words".  There was a premium in keeping code on the same "page" (faster, smaller) -- a colleague and I formulated the Claim "You Can Always Save One Core Location" (but we knew we couldn't apply this repeatedly ...).  This wasn't true then, and is likely not true now (just iterate the claim ...).

Bob Schor

[crossrulz]

---

@GerdW wrote:

Hi RavensFan,

you were asking for this:

Two options :D:D:D

---

Still too complicated.  Just have the terminal with the indicator's default set to 2.

[altenbach]

---

@crossrulz wrote:

---

@GerdW wrote:

Hi RavensFan,

you were asking for this:

Two options :D:D:D

---

Still too complicated.  Just have the terminal with the indicator's default set to 2.

---

Why is it DBL? That's 8 times too many bits! U8 is sufficient!

(I would just write a diagram comment containing the character "2")

[crossrulz]

---

@altenbach wrote:

(I would just write a diagram comment containing the character "2")

---

Constant folding eliminates the code all together.  So I would just have a blank VI.  But if we are going that far, no VI!

[altenbach]

---

@PriyadarsiniS wrote:

Is this signify equal, number to string conversion and reverse strings shouldn't be said functions. Am I clear ?!

---

No, not clear at all. What is "this" and what does the rest of the sentence even mean?

---

@PriyadarsiniS wrote:

My work is to reduce the functions used and to check Palindrome, whatever be the numeric range. 

---

This is a very open ended statement. How about integers that don't fit into a numeric datatype, such as a number with tens of thousands of digits?

---

@PriyadarsiniS wrote:

---

Can you explain your reasoning for using a WHILE loop here? The fact that you are using a while loop tells me that you are not an experienced programmer and don't know about datatypes. First of all, if you don't stop the loop relatively quickly, you'll run out of memory. After 2^31 iterations you have reached the end of the range of the I32 datatype of the iteration terminal and all further iterations are meaningless. An array cannot have more elements, because the index is also I32. You could use 8x less memory by using every bit (i,e LV4.x type flattened boolean array) but then the lookup code would need more primitives.) Another option would be to only store palindromes and do a binary search of the array to see if an input exists. You probably could even do something with variant attributes.

[Jacobson-ni]

---

@altenbach wrote:

---

@crossrulz wrote:

---

@GerdW wrote:

Hi RavensFan,

you were asking for this:

Two options :D:D:D

---

Still too complicated.  Just have the terminal with the indicator's default set to 2.

---

Why is it DBL? That's 8 times too many bits! U8 is sufficient!

(I would just write a diagram comment containing the character "2")

---

A U8? Do you think bits grow on trees? Use FXP<+,1,2>

Or maybe a 0-byte file with the name "2"

[altenbach]

---

@Jacobson-ni wrote:

---

Or maybe a 0-byte file with the name "2"

---

I am holding up two fingers. Good enough?

[Ben]

While not my area of expertise...

Can it be done using a regular expression?

Ben