Search Results

Search found 78 results on 4 pages for 'factorial'.

Page 2/4 | < Previous Page | 1 2 3 4  | Next Page >

• Euler Problem 20

  - by MarkPearl

  This was probably one of the easiest ones to complete – a quick bash got me the following… The Problem n! means n (n 1) ... 3 2 1 For example, 10! = 10 9 ... 3 2 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of the digits in the number 100! The Solution   private…

  Read the article

• x86 Assembly Question about outputting

  - by jdea

  My code looks like this _declspec(naked) void f(unsigned int input,unsigned int *output) { __asm{ push dword ptr[esp+4] call factorial pop ecx mov [output], eax //copy result ret } } __declspec(naked) unsigned int factorial(unsigned int n) { __asm{ push esi mov esi, dword ptr [esp+8] cmp esi, 1 jg RECURSE mov eax, 1…

  Read the article

• from loop to Nested loops ?

  - by WM

  I have this program that returns a factorial of N. For example, when entering 4,,, it will give 1! , 2! , 3! How could I convert this to use nested loops? public class OneForLoop { public static void main(String[] args) { Scanner input = new Scanner(System.in); System.out.print("Enter a number : "); int…

  Read the article

• Need help understanding a recursion example in Python

  - by Ali Mustafa

  Python is my first programming language, and I'm learning it from "How to Think Like a Computer Scientist". In Chapter 5 the author gives the following example on recursion: def factorial(n): if n == 0: return 1 else: recurse = factorial(n-1) result = n * recurse return result I understand that if n = 3, then the…

  Read the article

• J: Self-reference in bubble sort tacit implementation

  - by Yasir Arsanukaev

  Hello people! Since I'm beginner in J I've decided to solve a simple task using this language, in particular implementing the bubblesort algorithm. I know it's not idiomatically to solve such kind of problem in functional languages, because it's naturally solved using array element transposition in imperative languages like C, rather than…

  Read the article

• Best intro to C++ static metaprogramming?

  - by jwfearn

  Static metaprogramming (aka "template metaprogramming") is a great C++ technique that allows the execution of programs at compile-time. A light bulb went off in my head as soon as I read this canonical metaprogramming example: #include <iostream> using namespace std; template< int n > struct factorial { enum { ret =…

  Read the article

• User defined literal arguments are not constexpr?

  - by Pubby

  I'm testing out user defined literals. I want to make _fac return the factorial of the number. Having it call a constexpr function works, however it doesn't let me do it with templates as the compiler complains that the arguments are not and cannot be constexpr. I'm confused by this - aren't literals constant expressions? The 5…

  Read the article

• Can continuations be used as a replacement for recursion?

  - by Sam

  The following function generates a 'stack level too deep (SystemStackError)' for n = 5,000 def factorial(n) n == 0 ? 1 : factorial(n -1) * n end Is there a way to avoid this error using continuations/callcc? Note: I know this can be implemented without recursion. e.g. def factorial2(n) (1..n).inject(1) {|result, n|…

  Read the article

• Prolog: declaring an operator

  - by B K

  I have defined ! (factorial) function and registered it as arithmetic function and an operator, so that I can execute: A is 6!. Now I'd like to define !! (factorial of odd numbers), but the same way - writing clauses, registering arithmetic_function and operator, calling A is 7!! - results in SyntaxError: Operator…

  Read the article

• How can I access the JavaScript global object ("window") inside an embedded browser object (the IWebBrowser2 interface)?

  - by John Factorial

  I have an HTML page which embeds an IWebBrowser2 ActiveX (i.e. the control is essentially an Internet Explorer browser). I need to write JavaScript in this HTML page which will remove any window.onresize handler from the page loaded in the IWebBrowser2 control. IWebBrowser2 exposes the DOM through…

  Read the article

• How to use DLL reference with an ActiveX <object> via JavaScript

  - by John Factorial

  My question: how can I set an ActiveX object's property via JavaScript to an enum value found in a non-ActiveX DLL? Problem description: I am instantiating an ActiveX object with the following object tag: <object classid="clsid:F338193D-2491-4D7B-80CE-03487041A278" id="VideoCapture1"…

  Read the article

• How to return array of C++ objects from a PHP extension

  - by John Factorial

  I need to have my PHP extension return an array of objects, but I can't seem to figure out how to do this. I have a Graph object written in C++. Graph.getNodes() returns a std::map<int, Node*>. Here's the code I have currently: struct node_object { zend_object std; …

  Read the article

• How can I return an object into PHP userspace from my extension?

  - by John Factorial

  I have a C++ object, Graph, which contains a property named cat of type Category. I'm exposing the Graph object to PHP in an extension I'm writing in C++. As long as the Graph's methods return primitives like boolean or long, I can use the Zend RETURN_*() macros (e.g. RETURN_TRUE(); or…

  Read the article

• How would you answer Joel's sample programming questions?

  - by Khorkrak

  I recently interviewed a candidate for a new position here. I wish though that I'd read Joel's Guerrilla Guide to Interviewing prior to that interview - naturally I happened upon it the night afterwards :P http://www.joelonsoftware.com/articles/GuerrillaInterviewing3.html So I tried…

  Read the article

• Writing an auto-memoizer in Scheme. Help with macro and a wrapper.

  - by kunjaan

  I am facing a couple of problems while writing an auto-memoizer in Scheme. I have a working memoizer function, which creats a hash table and checks if the value is already computed. If it has been computed before then it returns the value else it calls the function. (define…

  Read the article

• algorithm to combinatorics

  - by peiska

  I am trying to solve a combinatorics problem, it seems easy, but i am having some trouble with it. If i have at most X tables, and N persons to sit on the tables, Each table can have 1 to N seating places, and I can only sit persons in one side of a rectangular table( so the…

  Read the article

• Has anyone got a polynomial time algorithm for find a Hamiltonian walk in a graph

  - by Nat

  My algorithm is N factorial and is really slow.

  Read the article

• Opinion on "loop invariants", and are these frequently used in the industry?

  - by Michael Aaron Safyan

  I was thinking back to my freshman year at college (five years ago) when I took an exam to place-out of intro-level computer science. There was a question about loop invariants, and I was wondering if loop invariants are really necessary in this case or if the question was…

  Read the article

• C++ Recursion Issue

  - by stupidmonkey

  Hi guys, I feel a little dumb asking this, but here we go... When trying to follow the Recursion example at the following website http://www.cplusplus.com/doc/tutorial/functions2/, I ran into a road bump that has me perplexed. I altered the code slightly just to get my…

  Read the article

• Techniques for getting off the ground in any language

  - by AndyBursh

  When I start learning a new language, I have a couple of simple implementations that I like to complete to familiarise myself with the language. Currently, I write: Fibonacci and/or factorial to get the hang of writing and calling methods, and basic recursion Djikstras…

  Read the article

• Why must named functions be in a separate file in hugs?

  - by Casebash

  In Haskell in 5 steps the factorial function is defined as follows: let fac n = if n == 0 then 1 else n * fac (n-1) But for hugs, it says that fac needs to be in fac.h. Can anyone explain why this is the case - missing the ability to define recursion seems like a…

  Read the article

• Why must recursion be in a separate file in hugs?

  - by Casebash

  In Haskell in 5 steps the factorial function is defined as follows: let fac n = if n == 0 then 1 else n * fac (n-1) But for hugs, it says that fac needs to be in fac.h. Can anyone explain why this is the case - missing the ability to define recursion seems like a…

  Read the article

• How can I improve my logical and analytical thinking skills so as to become an awesome programmer ?

  - by happysoul

  solve puzzles ? Solve programming problems ? what else ? Someone told me that I need begin with solving typical programs in C like those of factorial, recursion etc to improve logical thinking skills. What else do I do ? How do i go about it ? I am a beginner to…

  Read the article

• How to fix this python program?

  - by Phenom

  import math def p(n): return 393000*((288200/393000)^n * math.exp(-(288200/393000)))/math.factorial(n) print p(3) When I run it, I get the following error message: Traceback (most recent call last): File "poisson.py", line 6, in <module> print…

  Read the article

• Infinite loop in haskell? (newbie)

  - by Mike

  I'm just learning Haskell. I thought this would produce a factorial function... (within ghci) Prelude let ft 0 = 1 Prelude let ft n = n * ft (n - 1) Prelude ft 5 (hangs indefinitely, until ^C). Can someone point me in the right direction? Thanks!

  Read the article

< Previous Page | 1 2 3 4  | Next Page >