Search results for query: *

the code to find the primes numbers like this...so all I have to do now is find the palindromic primes. Is there a way to find them without using arrays or pointers? for (i=1;i<=max;i++) { again: m=(n/k)*k; if (m!=n) k=k+1; else goto try1; if (k < n/2) goto again; else...

I would like to print out the Palindromic primes of 5 digit numbers and then get a check sum of the also. Here is my code for printing the primes, but how do I check to see if they are panlindromic?? #include <stdio.h> int main(void) { int num=100000; int i; for(i=2; i<num; i++)...

I'm using windowo ME and my msdos is acting very weird. Normally when you run msdos from the desktop it opens it up in a window, but mine takes over the whole screen. Is there a way to fix this?

Is there a way to automount my windows partition into linux without me having to manually mount it everytime I start up Linux? I am using the newest version of RedHat

I need help finding the depth of a binary tree. I want to run this after each insert and print out the depth. Any help would be appreciated. Can anyone give me some sample code that would do this or tell me how to do this??

I was just wondering if I was doing this right. What I am trying to do is change the array references to pointer references and then use pointers and dereferenced pointers rather than array references. Any help would be appreciated!! original void sort(int *arr, int size) { int i, j, k, l...

int fill() { double *allocated; int n; if (allocated != NULL) { while (malloc (n *sizeof (double))) { allocated += 1; printf (&quot;Total Amount of Memory Used: %d \n&quot;, allocated); }free(allocated); return 0; } else{ printf(&quot;Memory Not allocated\n&quot;); return 1...

Basically this program takes two numbers and adds them together, but I can't get it to print the sum. Any help would be appreciated!! section .data big db &quot;Too Big&quot;, 0xA blen equ $ - big section .bss chr resb 2 sum resw 1 num resw 1 section .text global main main...

Yeah I want to know if the code I have actually works or if you know how to modify it to work like that.

I wanted to used a loop that mallocs a memory block of some size and then prints the total amount of memory used until it malloc returns a 0 or until it stops and crashes. This is what I have so far: int *allocated; int n; allocated = malloc(3 * sizeof(int)); for(n = 0; n < 3; n++); {...