Skip to content
@cppf

cppf

Popular repositories

  1. extra-swap extra-swap Public

    Macros to swap variables in C.

    C++ 2

  2. extra-array extra-array Public

    Generic array in C.

    C++ 1

  3. extra-macroarg extra-macroarg Public

    Manage arguments of macros in C.

    C++ 1

  4. extra-lib-todo extra-lib-todo Public

    Header-only library for C++

    C++ 1

  5. mpi-boruvka-mst mpi-boruvka-mst Public

    Get Minimum Spanning Tree of a connected Graph using Boruvka's Algorithm and MPI.

    C 1

  6. basic-proposal basic-proposal Public

    You have to design your own programming language ...

    VBA 1

Repositories

Showing 10 of 30 repositories
  • nvgraph.sh Public archive

    CLI for nvGraph, which is a GPU-based graph analytics library written by NVIDIA, using CUDA.

    C++ 0 MIT 0 0 0 Updated May 5, 2021
  • hello-world Public

    A "Hello, World!" is an introductory computer program.

    Python 0 MIT 0 0 0 Updated Apr 23, 2021
  • extra-boolean Public

    Boolean data type has two possible truth values to represent logic.

    C++ 0 MIT 0 0 0 Updated Apr 10, 2021
  • cppf.github.io Public

    Website for C/C++ header libraries.

    0 MIT 0 0 0 Updated Jan 8, 2021
  • number-base-conversion Public

    Base conversion is a method of changing the representation of a number from one set of symbols to another.

    C++ 0 MIT 0 0 0 Updated Dec 12, 2020
  • bisection-root Public

    The Bisection method is a root-finding method that applies to any continuous functions for which one knows two values with opposite signs.

    C++ 0 MIT 0 0 0 Updated Dec 12, 2020
  • regula-falsi-root Public

    The Regula–Falsi Method is a numerical method for estimating the roots of a polynomial f(x).

    C++ 0 MIT 0 0 0 Updated Dec 12, 2020
  • fixed-point-root Public

    Fixed-point iteration is a method of computing fixed points of a function, which is used with Newton's method to find roots of a differentiable function.

    C++ 0 MIT 0 0 0 Updated Dec 12, 2020
  • newton-root Public

    Newton's (Newton–Raphson) method is a root-finding algorithm which produces successively better approximations to the roots of a real-valued function.

    C++ 0 MIT 0 0 0 Updated Dec 12, 2020
  • secant-root Public

    The Secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f.

    C++ 0 MIT 0 0 0 Updated Dec 12, 2020
View all repositories

People

This organization has no public members. You must be a member to see who’s a part of this organization.

Top languages

Loading…

Most used topics

Loading…