nested-loops

I am attempting to create a C code that finds the factorial of a integer so that I may convert my code to assembly language. My code seems to 'multiply' the second integer twice. i.e. 5*4*4*3... I cannot seem to find out why. Help please! #define N 5 int main() { int j = 0; int i = 0; int num1 = N; int num2 = N - 1; int sum = 0; while (num2 != 0) { while (j < num2) { sum += num1; j++; } j = 0; printf("%d\n", sum); printf("--------------\n"); --num2; num1 = sum; } printf("--->%d", sum); } Erroneous Output: 20 -------------- 80 -------------- 240 -------------- 480 -------------- 480 Here's the

I have defined an alertcontroller when username or password is not correct the alert should pop, and it is working fine. but when the username & password is matched despite matching it pops up everytime when log in. I think I have not defined nested condition in a right way? help me to sort the multiple nested condition. Code for Login import UIKit import CoreData import Foundation class ViewController: UIViewController { var usernameGlobal : String = "" @IBOutlet weak var emailText: UITextField! @IBOutlet weak var passText: UITextField! @IBOutlet weak var loginButton: UIButton! @IBAction func

I really don't know how to find out the result of nested loops. For example in the following pseudo-code, I can't sort out what will be given at the end of execution. I'll be so glad if anyone gives me a simple solution. r <- 0 for i <- 1 to n do for j <- 1 to i do for k <- j to i+j do r <- r + 1 return r Question is: What is the result of the code and give the result r in terms of n ? I write it but every time I get confused. Grijesh Chauhan In your pseudo-code, Inner most loop, k <- j to i+j can be written as k <- 0 to i ( this is by removing j ). Hence your code can be simplified as follows

Somebody asked me a question: Which one is the fastest among the below two scenario: Case 1: assume int count = 0; for (int i = 0; i < 10; i++) { for (int j = 0; j < 5; j++) { count++; } } Case 2: assume int count = 0; for (int i = 0; i < 5; i++) { for (int j = 0; j < 10; j++) { count++; } } In both the scenario's the final valuse of count will be 50. But I am not sure which one will be faster? I think CASE II is faster but not sure... It will be great if anyone can throw some light on it. which is faster and why? this is the only example i can think of where it matters which variable you

I am new to Java programming and trying to learn the basics of coding. I want to know how this snippet of code works? for (int i = 1; i <= 5; i++) { for (int j = 1; j <= 10; j++) { System.out.print((i * j) + " "); } System.out.println(); } I will be really thankful if the programming sherlocks present here can explain me the logic. It will do... 1*1 1*2 1*3 till it gets to 1*10, then on a new line 2*1 2*2 2*3 and it will go to all the way to . . 5*10 So it will print out 1 2 3 4 5 ... till 10, then do a new line. Output below. 1 2 3 4 5 6 7 8 9 10 2 4 6 8 10 12 14 16 18 20 3 6 9 12 15 18 21 24

I need to make a spiral pattern made of stars '*' using nested for loops. I managed to make outter lines, now I don't know how to repeat smaller swirls in the same place. What I should have: ********* * ******* * * * * * *** * * * * * * * ***** * * * ********* Any help would be greatly appreciated. After being thoroughly nerd-sniped , I came up with this: #include <stdio.h> void print_spiral(int size) { for (int y = 0; y < size; ++y) { for (int x = 0; x < size; ++x) { // reflect (x, y) to the top left quadrant as (a, b) int a = x; int b = y; if (a >= size / 2) a = size - a - 1; if (b >= size /