3,815 Topics
![]() | |
I am getting a few errors on my code. I know my INT and CHAR are not correct. Just not sure where. I am trying to pull data from a file. The data is a day ( and integer 01, 02, 03) a time of day HH:MM, and a level … | |
Hello, Please disregard any small syntax errors I have made in this question, I’m trying to simplify a program that is many pages long. I have a program that has 2 parts, main.cpp and a form GUI.h. Both have functions that pass variables between themselves and I don't want to … | |
:-/ Hello everyone!!! Could you help me by giving some examples?... I have to write a code which would apply an InterpolationSearch to an array of 1000 strings using a reccurtion... The problem is that I can't find any examples... [COLOR="Red"] HELP!!:?: [/COLOR] | |
I'm trying to get the key being pressed in order to start an algorithm and afterwards move the mouse on the screen and perform some clicks. How can I achieve this when the console is in the taskbar ? I tried _getch() but it doesn't work while the console is … | |
I'm trying to translate a Pascal mouse movement algorithm to C++ but I'm not too good at it. The mouse moves to a position but when it moves again it only goes a small increment and crashes after a few more moves or if I move the mouse a few … ![]() | |
Read number(N)keyed in by user Set factorial to 1 While N is not equal to 0 Set factorial=factorial*N Set N= N-1 End While Display factorial | |
I really need help in trying to understand what the "dat:table" is in this procedure, and how to translate it to Java. procedure Taylor(var dat: table ; cd: integer; h: real); begin for i:=2 to cd + 1 do begin dat[i,1] := dat[i,1] + (i-1)*h; x := dat[i-1,1]; y := … | |
Is there a systematic method to analyze the time complexity of a program strictly from output data such as run-time, the number of data swaps, data comparisons, etc? For example... [icode] Data Size | Run Time | Comparisons | Moves --------------------------------------------- 1000 | 0.00 | 15448 | 23965 10000 | … | |
hi ..spandanagella, i'm working on a project to develope a crawler using concepts of web mining.. i'm trying to implement an algorithm on java.. | |
I have tried to start this program but I am so confused with dealing with strings. If any one could take a look and tell me if im on the right path it would be greatly appreciated. Heres the problem and what I have so far: An organization wants to … | |
hi!im a student and we have an exercise where we are asked to search for a client of our "bookstore" with interpolation search.The codes are saved in a Code[1000] matrix.The type of each code is like that: for example: AY568UTH or MLK1211 etc. Im new at programming and i dont … | |
Device an algorithm to test whether the three numbers represents the side of a right angle triangle | |
I need to implement Huffman coding using a binary tree. I have successfully created the tree and have been able to execute the program by manually entering the characters and their frequencies but I now need to read the characters/frequencies from an input file and then output their matching Huffman … | |
Hi guys, ive never visit this forum..this is my 1st time here...i think this is the most suitable forum to my problem.all peoples here is talented about algorithm. want to discuss with u guys and begging your opinion or suggestion to solve my problem. i have this input input[0]={0,1,2,3} input[1]={0,1,2} … | |
![]() | Hello. I am writing a program with some dynamic arrays of pointers to objects (not arrays of objects). Since there will be A LOT of tacking on new objects to the arrays, for the purposes of efficiency, I am implementing an algorithm to fill up a buffer array first and … ![]() |
how can i make this code more efficient (e.g less code inside the loop)? [CODE]loop: beq $a0, $a1, exit slt $t0, $a0, $a1 bne $t0, $zero, label sub $a0, $a0, $a1 j loop label: sub $a1, $a1, $a0 j loop exit: add $v0, $zero, $a0 [/CODE] thanx | |
[QUOTE]This discussion has been moved from [url]http://www.daniweb.com/forums/thread284115.html[/url]. Check there for the beginning.[/QUOTE] = = = = = = = = = = = = = = = = = = = = Actually neither approach is wrong. The original code does not store prime numbers but does correctly identify all … | |
I need an advice about the algorithm I have to use in order to find and return the shortest path in a graph like the one I uploaded. I'm lloking for the shortest path between two points, the lower left and the upper right. Thanks | |
Firstly I want to show you the code and it can run properly: You may copy each file and paste them into a C++ software and run it please. [B][U]Trader.h file[/U][/B] [code] const int NumSeller = 1; const int NumBuyer = 1; const int NumBids = 10; const int MinQuantity … | |
I am trying to write an algorithm to determine the average of a linked list of real numbers with the first node pointed to by first... ptr = first; while (ptr != null_value) { //not sure what to put in here } Can someone take a look of this short … | |
I am working on another linked list problem...really been struggling with this chapter dealing with lists...Here is the instruction for this example... Write an algorithm to search a linked list with the first node pointed to by first for a given item and, if the item is found, return a … | |
This is a code to solve a maze using A* search algorithm. When I run it, it gives me the following error: Exception in thread "main" java.lang.NullPointerException Can someone help me out? Below is all the code: [CODE] import java.util.List; import java.util.ArrayList; import java.util.Queue; import java.util.PriorityQueue; import java.util.Stack; public class … | |
i have to this the data structure and algorithm past question to solve and i am find difficult in some of the question. these are some of the questions 1. Draw the internal memory respresentaion of a binary tree using the linked - list structure. 2. if a 2-dimensional array … | |
Hi guys, want to discuss with u guys and begging your opinion or suggestion to solve my problem. i have this input input[0]={0,1,2,3} input[1]={0,1,2} input[2]={0,1,2,3} input[3]={0,1} value=2,3 and when value=3,binary binary[0]={0,1,1,1} binary[1]={1,0,1,1} binary[2]={1,1,0,1} binary[3]={1,1,1,0} and when value=2,binary binary[0]={0,0,1,1} binary[1]={0,1,1,0} binary[2]={1,1,0,0} binary[3]={1,0,0,1} if user choose value=2,result should b like this: (i … | |
Hello. I'm currently developing an IVR system under Asterisk through the Asterisk Gateway Interface (AGI), connecting to a Mysql server using the Mysql C API. The server returns a ticket number that I have to say to the client, so I developed a TTS (Text To Speech) algorithm to say … | |
Ok so i have a merg sort algorithm in my code yet for some reason its not letting me change it to what I need. Im not seeing where I have the mistake. any help? here are my files along with error. I am trying to sort the events by … | |
Hi fellas..this is my first post here..I am new to this 'hardcore programming' and all..I came across a problem for which I killed some time..with no fruits..It might be simple,trivial or even 'famous' for you guys..Any assistance is appreciated much.So here it goes.. Given an integer,the problem is to find … | |
Hi Everyone, I need help understanding how these traversals work :s [url]http://en.wikipedia.org/wiki/Tree_traversal[/url] On this page they have the code for these tree traversals, but I don't quite get it. For example, printing using the in-order traversal (using the example tree provided on the site) should give: A, B, C, D, … | |
Hello, I'm making a program that can play Bejeweled 2. Everything is working smooth except for a glitch in the movement algorithm. If anyone is really good at making these type of algorithms can you look at this code and/or give me some hints ? This is the core algorithm … | |
[CODE]#pragma warning (disable: 4786) #include <algorithm> #include <iostream> #include <string> struct PhoneBook { PhoneBook(std::string s, long num) { name = s ; number = num ; } PhoneBook() {} friend std::ostream& operator<<(std::ostream&, const PhoneBook&) ; long number ; std::string name ; } ; std::ostream& operator<<(std::ostream& os, const PhoneBook& rpb) { … | |
I have visited this forum many times in the past and I decided to actually join. My first question - where is the encryption algorithm actually implemented in bluethooth? more specifically bluez. I have been sifting through the bluez code trying to find this, and so far I have only … | |
[code] 842 M C 20.00 15 2 250 10.00 UC RosebudTheatre 90 One Mike Stand 990 E C 20.00 19 2 1250 10.00 TX TexasHall 75 Maverick Speaker Series554 C N 16.45 30 1 35 0.00 UC PaloDuraLounge 60 Global Grounds Coffee Hour 318 E C 18.00 3 4 350 … | |
hi, I am a new member here i hope that found some one who can help me in this C++ project I am a novice in C++ and this will be my first code if any one has experience please help me in the algorithm and what should i do … | |
Hello! I'm working on a project for class (Assembly Intel 8086) and am having trouble figuring out my problem with this program. The project is to set-up to find GCD of two numbers. However, I can't figure out why the division loop I have isn't working properly. I have the … ![]() | |
I want to call a C++ program from PHP with apache server on Fedora 12 linux. testprog is put in the same directory of the test php program. I see the output of exec('ls -lrt') but not exec("testprog"). Please help. The following are my php and cpp test programs. [CODE]<html> … | |
I ran into this particular problem at work and found it quite interesting. While implementing a multi-level image threshholding algorithm, I discovered that I needed to find all the ways I could partition a range of integers into some number of consecutive groups. I like my solution, but there may … | |
When many people think of internet or tech start-ups they automatically think Silicon Valley or California, well I’m here to say that is not true at all. Many great ideas are born from New York, in fact there a very large technology Meetup group [over 13,000 technologists] called [URL="http://nytm.org/"]NY Tech … | |
I implemented a BFS on a maze that I made, but the one problem that I have is that I do not know how to obtain the indices of the path that it took to solve the maze. Right now all my BFS algorithm does it prints out if it … | |
Hey guys, this is my first time posting. I'm almost done with the whole program but the only problem left is the word frequency counter. I have file(.txt) that the program reads on and it outputs the words aphabetically and if the word has been seen, it adds a count … | |
I have to implement a simple infinite sum which estimates the value of PI. The more iterations of the infinite sum, the more accurate the value of PI. Using the equation PI=4x(1-1/3+1/5-1/7+1/9-1/11+1/13-....) .The details of the program are as follows: 1. The program must have a small menu for the … | |
the problem is- it is required to store 'big integers'(more than alloted space for integers), suggest a suitable method by which big integers can be stored , also device an algorithm for adding of such numbers.. the just need the method of achieving this.i can write the code in any … | |
Hi everyone, I am working on a project that requires me to write a program which given a single word will search a database of thousands of songs and will return the artist, title, and the context in which the word appears in the song. Each song has a SongId … | |
My program is created to output permutations. Depending on the input that I put in, I sometimes get the correct result, but it is not accurate. However, when I do "abc", I get the correct result. When I input peoples names, I get a random result. After trying to figure … | |
Hello I have 4 .py files along with __init__.py in a folder. I want to create a file which would act as a menu and load classes from the files in that folder. I have that file outside the folder. The contents of that file: [CODE]from files import * print … | |
Hi, I have a homework assignment to copy the elements of one stack to the other except in reverse order. The algorithm is easy enough for me to figure out and implement. My only question is, I dont really understand how im supposed to add my own function to a … | |
In my program below, I am having problems running my program. The error I receive is "could not convert `nextPermutation(((char*)(&elements)), n)' to `bool'" I just want to print out the permutation of ABC. Will someone please check my nextPermutation function to see if everything is correct. I know there a … | |
Hi, i need your expertise in this one. i am new to python, i want to write an algorithm that takes a string as input and determines whether or not it is a palindrome. please point me to the right direction. Thanks in advance. sabiut | |
Hello all, I wrote a jsp page. It has a form with a submit button that sends the data to some algorithm. I would like the submit button to load a "please wait" html. After the algorithm is done - that "please wait" page will be auto redirected to a … | |
I want to develop a java application for converting indian time to any world time. I also want to include the daylight saving also. Can anyone please tell me the algorithm to convert indian time to world time? | |
![]() | Hi. Please refer the code. I am having trouble in the 3 times nested loop (at the end) [code="php"] <?php error_reporting(E_ALL); ini_set('display_errors', true); ini_set('html_errors', true); function remove_blank_spaces($strWhite) { trim($strWhite); $string = ""; for($i=0; $i<strlen($strWhite); $i++) { if($strWhite[$i]!=" ") { $string .= $strWhite[$i]; } } return $string; } function get_all_substrings($input, $delim='') … ![]() |
The End.