Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
0% Quality Score
Upvotes Received
0
Posts with Upvotes
0
Upvoting Members
0
Downvotes Received
1
Posts with Downvotes
1
Downvoting Members
1
0 Endorsements
~2K People Reached
Favorite Forums
Favorite Tags
java x 11
c++ x 4
Member Avatar for Gnawk

Hi i need to make a method that does the example below if the array contains these number -12 3 -12 4 1 1 -12 1 -1 1 2 3 4 2 3 -12 The output should be: N Count 4 2 3 3 2 2 1 4 -1 1 …

Member Avatar for NormR1
0
115
Member Avatar for Gnawk

Hi the project i have is Write a program that displays diamonds as text using a character provided by the user. For example, a diamond of height 6 constructed from asterisks will display as follows: __* _*** ***** ***** _*** __* (I cant make it line up perfectly... ) after …

Member Avatar for Gnawk
0
330
Member Avatar for Gnawk

This is just a part of a program When my code asks me Enter diamond size ("short", "average", or "tall"): how do i make it so that if i don't put anything and press enter it asks me exactly same questions again?? i tried putting input.length() == 0 or input.equals("") …

Member Avatar for Gnawk
0
76
Member Avatar for Gnawk

C++ program that will implement the popular numerical procedure called Thomas Algorithm. this is my final project in the lab which i have no idea how to start off... and i am really bad at c++ because this was my first ever programming class i ever took in my life... …

Member Avatar for WaltP
-1
1K
Member Avatar for Gnawk

#include <iostream> using namespace std; bool isPrime (int num) { int counter=0; { for(int i=1; i<=num ; i++) if (num%i==0) counter++; if (counter==2) return true; } return false; } //prints primes void printPrimes (int num) { for(int i=2;i<=num;i++) if (isPrime(i)) cout<<i<<","; } // if there is no prime number between …

Member Avatar for Gnawk
0
124