405 Topics
|
|
|
In my web site, I'm using JAVA Script image scroller, in home page just below the logo. Is there any risk of having such images in top half of the web page. I mean would Google miss-dentify that as a advertisement above the fold with Page Layout algorithm. What are …
|
|
I have these sorting algorithms in my application, and I want to keep track the affected values, or the values that swapped during the sorting process. I want to highlight them. I have solved this issue for bubble sort and selection sort, but somehow I can't get it work with … 
|
|
|
alright guys so am havign trouble finding a way to search for seats that are toghether, my pgram consists of a theater with 20 x 10 seats, i have created a seatSelection class and the theater file which has the main. Ok so heres a sample output of how it …
|
|
|
Hello, What is the best way to check my code? I have written a program that counts the swaps required to sort an integer array using the Bubble, Selection, Insertion and Quick sort methods. How can I be absolutely certain that my swap counts are correct? Will someone take a …
|
|
Hey guys, I'm trying to understand how radix sort works in C++ : I've looked over the C++ implementation from wikipedia: void radixsort(int *a, int n) { int i, b[MAX], m = a[0], exp = 1; for (i = 0; i < n; i++) { if (a[i] > m) m … 
|
|
|
I am trying to do a C++ coding. I am trying to do problem in which i have numbers of points. Now i need to find the path that goes through all the points. This is not actually TSP because as per my knowledge in TSP it is possible to …
|
|
|
new to I.T. need help about the problem analysis ,algorithm design, formatting the output package gasolinestation; import javax.swing.JOptionPane; public class GasolineStation { public static void main(String[] args) { float total, money; String yesno; JOptionPane.showMessageDialog(null, "Welcome to Gasoline Station!"); do { String select = JOptionPane.showInputDialog(null, "1 = Diesel .................... $ 39.00\n" … 
|
|
Hi everyone, I'm learning C# at the moment and really enjoying it. I'm wondering though how I can develop my own algorithms. do I need to read on data structures and algorithms? Is there a book for all programming languages so you can apply the knowledge to basically any programming … 
|
|
|
I am working on a project about data mining. my company has given me 6 million dummy customer info of twitter. I was assigned to find out the similarity between any two users. can anyone could give me some ideas how to deal with the large community data? Thanks in …
|
|
Hi there I'm working on bresenham ellipse drawing and i have few problems <!DOCTYPE html> <html lang="en" xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8" /> <title>Rasteryzacja Elipsy</title> <link rel="stylesheet" href="app.css" type="text/css" /> <script type="text/javascript" src="http://canvg.googlecode.com/svn/trunk/rgbcolor.js"></script> <script type="text/javascript" src="http://canvg.googlecode.com/svn/trunk/canvg.js"></script> <script type="text/javascript" src="http://code.jquery.com/jquery-1.8.3.min.js"></script> <script src="raphael.js"></script> <script src="svgfix-0.2.js"></script> <script> function toImg(){ var svg = $("#svg_drawing").html(); svg=svgfix(svg); …
|
|
|
i need c++ code for simple linked list to implement algorith and data structure 1.create_node_and add to list 2.frst node delete 3.last node delete 4.delete node between first and last node 5. displaye the value of node in revese order 6. searching 7.exist
|
|
|
For each part (A) (D) below, clearly indicate whether the runtime is O(log n) or O(n). Can someone please explain how this works? public class Q9f { public static void main(String[] args) { int n = ...; int[] a = new int[n]; // (A) for (int index = 0; index … 
|
|
|
I am trying to switch the below code to sort in descending order rather than ascending. It works when counting upwards, but nothing I try helps with getting it to count starting with the largest number and count downward. public static void insertionSort(Comparable[] list) { for (int index = 1; … 
|
|
|
Error 6 error C2143: syntax error : missing ';' before ')' c:\users\datacompress.cpp 214 1 Error 8 error C2039: 'putSymbol' : is not a member of 'std::basic_ofstream<_Elem,_Traits>' c:\users\datacompress.cpp 291 1 Error 9 IntelliSense: class "std::basic_ofstream<char, std::char_traits<char>>" has no member "putSymbol" c:\users\datacompress.cpp 291 12 #include <fstream> #include <string> #include <iostream> #include <ostream> …
|
|
|
I won't be asking for a source code yet. What I need to figure out is the process of a certain Math problem with the equation that seemed to be impossible to be converted to source code. Here it goes: **A certain waveform is 0 volts for time less than … 
|
|
|
yesterday one of my friend tell me to make RTS engine in pygame......I know basic things which is used to make RTS Like 1. Unit selection 2. Unit moving 3. Resource management But only 1 thing i still cant figure out....Which is path finding.....I read all articles which is on …
|
|
|
what is the algorithm for insertion in binomial queue and is tt there a concurrent access to binomial queue
|
|
|
Question #1 write an algorithm to find smallest of n numbers , assume tht the numbers should be less than 9999 Question #2 draw a flowchart to read x nd compute y on the basis of the following information: if x<0.5 then y=0 if 0.5<0r= x <1 y=x3+3x if x …
|
|
|
Credit card numbers follow certain patterns. A credit card number must have between 13 and 16 digits. It must start with: 4 for Visa cards 5 for Master cards 37 for American Express cards 6 for Discover cards In 1954, Hans Luhn of IBM proposed an algorithm for validating credit … 
|
|
|
Hello DaniWeb, First off, I am not looking for code, at least not yet. I also honestlly don't know where to post this, but since I'm using PHP, what the heck. If you're an admin and can help me find more relevant answers by changing the "forum type", so be …
|
|
|
Hi everyone... im using C++ Microsoft visual studio and would appreciate if you can help me out here. Ive been trying to do this the whole day ... and canttt figure it outtt PLEASEE HELPPP !! I am a total beginner so sorry if i have very stupid mistakes. #include … |
|
Hi, I am just trying to do some program on arithmetic expression parsing. So i want to store my operator precedence table in the program somehow. I could use a multidimensional array, but that would be inefficient i guess. Another idea i have is to use a HashTable, where the …
|
|
|
The instructions are long but here goes. The starting code they provided me is after the instructions. The bar codes used on products in a store are visual encodings of Universal Product Code (UPC) numbers. For example, 036000291452 is a UPC code (in this case for a box of tissues). …
|
|
can any1 give me flowchart and algorithm for 1) counting positive numbers from a given set 2) gcd and lcm of two numbers 3) smallest positive divisor of an integer other than 1 so from above i would be able to make program on my own
|
|
|
Hi I have a CS class assinment that invloves solving a word search puzzle with a brute force string matching algorithm. I have made a lot of head way in getting the four search methods to work, however when I search for words that end along the edges of the …
|
|
|
Lets say I have a Variable Partitioning with free space: at address 32k a free space of 8k, and at address 15k a free space of size 11k. I need to create a first fit free table, and a best fit free table Am I doing the right thing for … |
|
Given 3 arrays,one accepting Strings the rest integers,lets say:A1[ ],A2[ ],A3[ ]. We get the difference of each element of A2[ ] and A3[ ] to a previously define values. take for example this code: //preference.c #include<stdio.h> #include<string.h> typedef char * string; //for STRINGS char name; int test; // number … 
|
|
|
What is the running time for the following recursive function: pubic static int Sum(int [] a, int start, int end) { if ((end – start) = =0) return a[end]; else { int mid = (end + start) / 2; return (Sum(a, start,mid) + Sum(a,mid+1,end)); } } Can someone please explain …
|
|
|
Hello all! First time poster here and I'm looking for a little help figuring out the time complexity of this program. int y; void p(int x) { x = y - 1; y += x; cout << x << " " << y << endl; if (x<3) p(x); cout << … 
|
|
|
Hello, I am new to this web and new to programming. I am not sure what does mean the following algorithm: set counta = 0 set countb = 0 read number while read was succesful do if number mod 2 equals 0 then set counta = counta + 1 otherwise …
|
The End.