Maximum triangle path sum: Difference between revisions
Content added Content deleted
(Added an Algol 68 implementation) |
|||
| Line 83: | Line 83: | ||
=={{header|ALGOL 68}}== |
=={{header|ALGOL 68}}== |
||
{{works with|ALGOL 68G|Any - tested with release 2.6.win32}} |
{{works with|ALGOL 68G|Any - tested with release 2.6.win32}} |
||
Basically the same algorithm as Ada and C++ but using a triangular matrix. |
|||
<lang algol68># create a triangular array of the required values # |
<lang algol68># create a triangular array of the required values # |
||
| Line 134: | Line 135: | ||
+1320 |
+1320 |
||
</pre> |
</pre> |
||
=={{header|C++}}== |
=={{header|C++}}== |
||
{{trans|Ada}} |
{{trans|Ada}} |
||