Skip to content
Collection of solutions of some simple problems written in Prolog
Prolog
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
binary_tree
.gitignore
LICENSE
README.md
factorial.pl
fibonacci.pl
pow.pl

README.md

PrologSamples

This repository contains solutions of some simple problems written in Prolog.

Problems

  1. Calculate X to the power of N, for N>0. (pow.pl)
  2. Calculate N factorial, for N>0. (factorial.pl)
  3. Calculate N-th Fibonacci number, for N>=0. (fibonacci.pl)
  4. Check if structure is a binary tree. (is_binary_tree.pl)
  5. Sum all node values of a binary tree. (sum_binary_tree.pl)

Contributing

Want to contribute? You are welcome! Please add solutions to the repository, and description of a problem to README.md. Note that all pull request should go to development branch.

License

Copyright 2017 Vladimir Jovanovic

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

     http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
You can’t perform that action at this time.