51302018 GitHub -karanProjects-Soluions: Links fo others’ soltions to Projects (htpsigthub.conkaranProjecs!) B karan / Projects-Solutions in Gi Dismiss Join GitHub today Civ is home to over 20 milion developers working together to host ‘and review code, manage projects, nd ul sofware opether Signup Go Links to other’ solutions to Project (hts://athub.convkaranvProjects/) {B768 commits: PT branch O Oreleases: 8.150 contributors trockmater= || New pleut Fide Cloner downlod Hb aren commited on Fob 2017 Merge pu request A454 tom wiliavtunnwindpatch Latest commit 7486760 on Feb 8, 2017 README ma ‘Merge branch ‘master into paeh-1 a year ago ESREADMEmd ‘This repo links to solutions of Projects written by other users in any language. See how to contribute to this repo. Numbers Find PI to the Nth Digit - Enter a number and have the program generate Pl up to that many decimal places. Keep a limit to how far the program will go. [geekpradd (Python}] [MrBlaise (Pythont] {whoshuu (Python)] [tl Haskell] [petehuang (Ruby!) [atomie22 (PHP) [qutrk JavaScript) [ScottKolo (Go)][desertwebsesigns (Python) [aysark (Java) lazynight(Python)] [abadojack(Goy fabadojack(ava)}(lazy0getterSwif)] [mandeepohutani (Python) [ehibbyOne (C] esspls Uavall [nkuchampudi (avallkingballer29 (C+ #)]Imanateemilta ava] [viktorahlstrom (Bash)] [marcusmanteiro(Haskell]tlingineni (Python) lordturtlea 19 (C#)]Imicroice333(Python)] [wildautummwind (PHP) Find e to the Nth Digit - Just lke the previous problem, but with e instead of Pl. Enter a number and have the program generate e up to that many decimal places. Keep a limit to how far the program will go. (dhi112391 (ava}][aseeon {Python} llazyOgetter(Swittligrzeswol{Ruby)]Imandeepbhutani (Python)] [chibbyOne (C)] [hkuchampudi ava)(kingballer29 (C+ +)] [viktorahistrom (Bashj} [rlingineni (Python][microice333 (Python)] Fibonacci Sequence - Enter a number and have the program generate the Fibonacci sequence to that number orto the Nth ‘number. [MrBlaise (Python) [timkaboya (Python) [whoshaw (Python) [mayankj08 (Bash) [tel (Haskel) [petehuang (Rub [oleseo (C]latomic22 (PHP) (quitrk UavaScript] [isccastilo(C#] [MikroMan (ava)][ScottKolo (Go) fbrotatotes (Python) [mandlya (C++) [Siverneo (Python) [desertwebdesigns Python) faysark (Java) (mukul3java] (Bhavika (C) {turlapatykaushik (Python)][neivin (Python)] Vosenberg (Ruby)l llszy0getter (Swift) [nokafor ()][rtwikmishra (avaScript)} {hollynicolemils Uavalichasmani(Rubyfcobin2t Uaval ehibbyOne (I thkuchampudi Uavaltkingballer29 (C+-+)} [manateemilti (ava) (vktorahistrom (Bash[kerabum (Python)]ipaatus (erlang [famvoid3 (C+ #] Prime Factorization - Have the user enter a number and find all Prime Factors (if there are any) and display them. (geekprac (C+) [geekprada (Python) (MrBlase (Python) [whoshuu (Python)][petehuang (Ruby) [aterkik (Haskell [boleselo(l] [quirk (UavaScript)JIMikroMan (Java [checkcheckzz (C++)][kdamball Javascript) [artuffet Python] [HedgehogOt (Java) [desertwebdesigns (Python) faysark (aval (chasmani (Ruby)] [chibbyOne (C)] [mehwalek (Clojure}][kvsingh (Python) [nkuchampudi Java] [viktorahistrom (Bash htpsiigthud.convkaran(Projects-Salutions ve51302018 GitHub -karanProjects-Soluions: Link fo others’ soltions to Projects (tps igthub.comkaranProjecs!) "Next Prime Number - Have the program find prime numbers untl the user chooses to stop asking for the next one. (MrBlaise (Python) [el (Haskell][petehuang (Ruby) [boleselo (C)] [quit (JavaScript) [MikroMan (Javal] [ScottKolo (Go}[Siiverneo (Pythom] [desertwebdesigns (Python!) [aysark Java] [Bhavika (©) [turlapatykaushik (Pythont] [nokafor(C)] [psk11 {atmtjavascript}) [chibbyOne (C)] thkuchampudi Java) Find Cost of Tile to Cover W xH Floor - Calculate the total cost of tl it would take to cover a floorplan of width and height using a cost entered by the user. Orhealsgood (Pythen)|[petehuang (Ruby)] [quite VavaScrnt Gbnune? (C+ )]lrasppie (Python) Ideserwebdesigns (ythonlivdrey Pythom]Josenberg (Rubyl] [nokafor() rancis36012 (C+~)][dsubis Python} {chibbyOne (C)[kingballer29 (Scala vktorahistrom (Bash]viktoralstrom (ava) Mortgage Calculator - Calculate the monthly payments of a fixed term mortgage over given Nth terms at a given interest rate. Also figure out how long it will take the user to pay back the loan, For added complexity, add an option for users to select the compounding interval (Monthly, Weekly, Dally, Continually). (petehuang (Ruby) bruno? (C+=)] [Scottkolo (Go)] [desertwebdesigns (Python!) francis36012 (lava) (viktorahlstrom (Bash)] CChange Return Program - The user enters a cost and then the amount of money given. The program wil figure out the change and the number of quarters, dimes, nickels, pennies needed for the change. [Drhealsjood Python) Ipetehuang {Ruby][MikeoMan (ava [ScottKolo (Go)}[desertwebdesigns (Python)]laysark ava] [dsub15 (Pythen)][mchwalek (lojure)] (wktorahstrom (Bash)lryjo1026 Vavaltingineni (C++) Binary to Decimal and Back Converter - Develop a converter to convert a decimal number to binary ora binary number to its decimal equivalent. [Drhealsgood! (Python) [petehuang (Ruby) [hx1997 (C)] [desertwebdesigns (Python)} [vinaynikhiI313 (Uava)] [mukul3 (C) [francis86012 (C+ +] hkuchampudi lava] [mandlya(c+ +) Calculator - A simple calculator to do basic operators. Make ita scientific calculator for added compleaity.[MrSlaise Python)] [tel Haskel)][ripperht (©) hx1997 (C) [desertwebdesigns (Python)][grzeswol (Ruby}|tholynicolemillsGava)]ipsk11 (HTML, 18) [wildautumnwind (PHP) Unit Converter (temp, currency, volume, mass and more) - Converts various units between one another. The user enters the ‘ype of unit being entered, the type of unit they want to convert to and then the value. The program will then make the conversion, [Drhealsgood (Python! [desertwebdesigns (Python)] [kurokuriboh (Java) Alarm Clock - A simple clock where it plays @ sound after X number of minutes/seconds or at a particular time. [smthe (@ythony] [averageprogrammer (Java)]{kingballer29 (Python) [rlinginen (CH) Distance Between Two Cities - Calculates the distance between two cities and allows the user to speeily a unit of distance, ‘This program may require finding coordinates forthe cities lke latitude and longitude, [tel (Haskell) [petehuang (Ruby) [dabillox (Python) [kingballer29 (©) Credit Card Validator - Takes in a creat card number from a common credit card vendor (Visa, MasterCard, American Express, Discover) and validates it to make sure that tis a valid number (look into how credit cards use a checksum) [kbchinski(/va}] [tel (HaskelD]Istupidgrass (Pythom)][MikroMan (Java [ScottKolo (Go)} [desertwebdesigns (Python)][dotslash Python)][Barvin (@ython)] Uosenberg (Ruby)ipsk11 (htmljs][Akuchampuai (aval [viktorahlstrom (Bash)][vktorablstrom (Python) ‘Tax Calculator - Asks the user to enter a cost and either a country or state tax. t then returns the tax plus the total cost with ‘ax [tel (Haskelh]bbruno2 (C++) [ScottKolo (Go) [brotatotes (Python) [desertwebdesigns (Python)] [neivin (Python)][Varey (Python) [viktorahlstrom (Bash) Factorial Finder - The factorial of a positive integer nis defined as the product of the sequence, n-1,n-2, 1 and the factorial of 0s defined as being 1. Solve this using both loops and recursion. (tl (Haskell) irramchand (python) [ScottKolo (Go)] [aysark (ava)] UaredCubilla avascript turlapatykaushik(Python)] Uosenberg (Ruby) [melvin0008(SML]melvind008 (Python llmelvin0006(haskell}imelvind008 (la) {hkuchampudi (aval [kvsingh (Python) fiamwoidt 3 (C+#)] Complex Number Algebra - Show adaition, mukplcation, negation, and inversion of complex numbers in separate functions. {Subtraction and division operations can be made with paits of these operations) Print the results for each operation tested. (tel (Haskeld) [aysark avallippype (python)][sjunhe (2) htpsiigthud.convkaran(Projects-Salutions 2851302018 GitHub -karanProjects-Solions: Link fo others’ solitons to Projects (htpsigthub.comkaranvProjecs!) Happy Numbers - A happy number is defined by the following process. Staring with any positive integer, replace the number by the sum of the squares of ts digits, and repeat the process until the number equals 1 (where it will stay, or it loops endlessly in a cycle which does not incde 1. Those numbers for which this process ends in 1 are happy numbers, vile those ‘that do not endl in 1 are unhappy numbers. Display an example of your output here. Find first 8 happy numbers. (Quoly @ython) [tel (Haskell [manoj1992Uava} [checkcheckzz (C++) [BinaryForest (Java) [aysark (Java [kiakosv (Python)] [chasmanifRuby))Inagelforian (Swift) [nkuchampudi (Java)] Number Names - Shovr how to spell out a number in English. You can use a preexisting implementation oF roll your own, but ‘you should support inputs up to atleast ane milion (or the maximum value of your language's default bounded integer type, if thats less). Optional: Support for inputs other than positive integers (like zero, negative integers, and floating-point numbers) [tel (Haske) [scottdchris (Python) [ScottKolo (Gol [checkcheckzz (C++)] Coin Flip Simulation - Write some code that simulates tipping a single coin however many times the user decides. The code should record the outcomes and count the number of tails and heads, (scotschris (Pythoril{aysark (Java) UaredCubila Wavascript dsub15 (Python)limandeepohutani (Python) {vktorahstrom (Bashllviktorahlstrom (Pythonl]vktorahstrom aval (mandlivatC+ +] Limit Calculator - Ask the user to enter f(x) and the limit value, then return the value of the limit statement Optional: Make the calculator capable of supporting infinite limits [ChrisBlair ava] Fast Exponentiation - Ask the user to enter 2 integers a and b and output ab (Le. pow(ab}) in Otlgn) time complexity [etislye1991(C+ #)][korabum (Python)} Classic Algorithms Collatz Conjecture - Start with a number n > 1. Find the number of steps it takes to reach one using the following process: If ‘nis even, divide it by 2. I'm is odd, multiply it by 3 and add 1. [EpicDavi Python] (amchand (/ava}](petehuang (Ruby)] [quitrk GavaScriph [taycaldwell(va)](anggiaj (Go)] [edeng (Java)]{uisceastillo (C¥)][vdrey (Python)]rancs36012 (Python)] [kingballer29 (C++))[manateemiltia Java] [viktorahlstrom (Python)] Sorting - Implement two types of sorting algorithms: Merge sort and bubble sort [petehuang (Ruby) (sanantht2 (C)] lligyangt Python) [ScottKolo (Go) [checkcheckes (C++)][yasasvyk (C+ +] [turlapatykaushik (C]lsmac89 (haskel] [sjunhe aval) Closest pair problem - The closest pair of points problem or closest pair problem isa problem of computational geometry given 1 points in metric space find a pair of points withthe smallest distance between them. (dabillox (Python [luyang (Python) [smac89 (C++) [sjunhe (aval] Sieve of Eratosthenes - The sieve of Eratosthenes is one of the most efficient ways to find al ofthe smaller primes (below 10, million o $0). (swapagarwal (Python)][quitrk YavaSeript] [luyangt (Python)][SeottKolo (Go)] [danfang (Java) [checkcheckaz (C+#)] [gautamé (rus) [korabum (Python)] Graphs Graph from links - Create a program that wil create a graph or network from a series of links.[arimleyS17 (Python) [rahuberarora(e+ 4) Eulerian Path - Create a program which will take as an input a graph and output either a Eulerian path or a Eulerian cycle, or state that itis not possible. A Eulerian Path starts at one node and traverses every edge of a graph trough every nade and finishes at another node, A Eulerian cycle isa euleran Path that starts and finishes at the same node. (DiegoAscano(Python)] Connected Graph - Create a program which takes a graph as an input and outputs whether every node is connected or not [BiegoAscanio(Python)] Dijkstra’ Algorithm - Create a program that find the shortest path through a graph using its edges. [mouradmouratig (ython)}frahubarora(e+ +) hntpsiigthud.convkaran(Projects-Salutions ae