# Snippet Library

**Browse
| Submit A New Snippet
| Create A Package**

## Snippets by category: Math Functions

Snippet ID | Title | Creator |
---|---|---|

Snippets | ||

11 | Decimal Empaquetado | Andres Ovalle |

Algoritmo de empaquetamientos de decimales. | ||

12 | Binario -> Hexadecimal | Andres Ovalle |

Conversion de un Binario a un Hexadecimal, en agrupacion de 4 bits | ||

16 | rank | rank1cheng |

a code snippet for generators | ||

31 | pidigits ocaml | MatÃas Giovannini |

OCaml code for the pidigits benchmark | ||

41 | C Code Bubble Sort | Ayla Stokes |

Bubble sorting algorithm that focus on comparing elements from the start of the array till to the end. This implementation is for new programming learners. I haven't used any libraries to get this task done. http://h3adrush.com/ is the principal owner of this code. And you can use, make changes & distribute this code, but you have to give attribution to the owners and all the other people involved in this code up-gradation chain. | ||

42 | C program of insertion sort | Melta Fitz |

Insertion sort works on the principle of simplicity, building one element at a time. It is a less efficient algorithm, when it comes to big arrays sorting but works best in short arrays. I designed this for new learners. I also submitted this on github and sourceforge. - afp.sourceforge.net/entries/Imperative_Insertion_Sort.shtml Copyright This program is the copyright of https://www.chicagoexcelclasses.com/ and you have to take permission before using it at anywhere. | ||

44 | Binary Search C++ Program | Andrea Hillerud |

This is a binary search program, upload by Ms. Andrea Hillerud. I love to create mathematical functions that are related to basic mathematics and how to manipulate those functions for greater publications. This program has 3 parts. First input, and second processor and third output. You can use the code anyway you want but you have to give proper credits to http://cheapautoinsurance.net before using, sharing, or editing it. | ||

45 | Fibonacci Series | Marilee Christy |

FS is simple but have vast applications. You have to add previous numbers, in order to get the next combinations. To get T(n,1), you have to add T(n-1,1)+T(n-1,2). Where n-1 is the level and also 1,2 are the respected positions on those levels. Copyright http://Itprogrammeur.com | ||

51 | Bubblesort | albertine dublin |

Bubblesort is a simple program which keep repeating itself until all the elements are placed in the correct order. In order to do so it compares adjacent elements and swaps them if later one is smaller than first one. It keeps swapping until no element needs to be swapped and thus the sequence is right. You can find more practical examples at http://www.psychic-abigail.com/ | ||

53 | Integrate Sum | Carolyne Rubiano |

Maths has lots of mathematical functions rather series that can't be computed manually even with calculator, unless you find some around the way methods, it is one of those functions. It keeps summing up the integers as the keep increasing and goes on doing that until specified and this is done using a library. Carolyne Rubiano - Accountant (http://www.pay-dayloans.com.au/) |