prgm4 - ; CSE 2240 prgm4 (main.asm) ; Trent Moore ;...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ; CSE 2240 prgm4 (main.asm) ; Trent Moore ; Re-write the following C++ program in assembler. The program contains two recursive algorithms ; >recPdrome accepts pointers to the first and last characters of a string and returns true if the ; string is a palindrome and false if it is not a palindrome. ; >recSearch is a binary search that returns the index of the value being searched for if it is ; present in the array, and returns a (-1) if the value is not in the array. ; **You musn't use the LOCAL, INVOKE, ENTER, LEAVE, USES, or PROC (with parameters) directives** INCLUDE Irvine32.inc .data ;pDrome stuff w1 BYTE "abcdef",0 w2 BYTE "aabbaa",0 pdm1 BYTE " is a palindrome",0 pdm2 BYTE " is not a palindrome",0 ;Search stuff ;array[10] = {-4,0,3,5,6,8,90,445,446,500}...
View Full Document

This note was uploaded on 04/05/2010 for the course CSE 2240 taught by Professor Staff during the Fall '08 term at Southern Methodist.

Page1 / 6

prgm4 - ; CSE 2240 prgm4 (main.asm) ; Trent Moore ;...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online