Baseline: tree as shared

This commit is contained in:
alexm committed 2026-10-05 03:03:38 +00:00
commit 31f2fb8a5a
1679 files changed
+1024562

No files matched your search

+38
View File
@@ -0,0 +1,38 @@
// Linear search three ways: with a flag, with BREAK, with RETURN; all three agree.
// EXPECT: 2 2 2
// EXPECT: -1 -1 -1
FUNCTION FIND_FLAG(Xs : LIST OF INTEGER, X : INTEGER) RETURNS INTEGER
DECLARE Found, I : INTEGER
Found <- -1
I <- 0
WHILE I < LENGTH(Xs) AND Found == -1
IF Xs[I] == X THEN
Found <- I
ENDIF
I <- I + 1
ENDWHILE
RETURN Found
ENDFUNCTION
FUNCTION FIND_BREAK(Xs : LIST OF INTEGER, X : INTEGER) RETURNS INTEGER
DECLARE Found : INTEGER
Found <- -1
FOR I <- 0 TO LENGTH(Xs)
IF Xs[I] == X THEN
Found <- I
BREAK
ENDIF
NEXT I
RETURN Found
ENDFUNCTION
FUNCTION FIND_RETURN(Xs : LIST OF INTEGER, X : INTEGER) RETURNS INTEGER
FOR I <- 0 TO LENGTH(Xs)
IF Xs[I] == X THEN
RETURN I
ENDIF
NEXT I
RETURN -1
ENDFUNCTION
DECLARE L : LIST OF INTEGER
L <- [4, 8, 15, 16]
OUTPUT FIND_FLAG(L, 15), " ", FIND_BREAK(L, 15), " ", FIND_RETURN(L, 15)
OUTPUT FIND_FLAG(L, 7), " ", FIND_BREAK(L, 7), " ", FIND_RETURN(L, 7)