473,721 Members | 2,402 Online
Bytes | Software Development & Data Engineering Community
+ Post

Home Posts Topics Members FAQ

Can you help me find my memory leak?

I don't know what standard protocol is in this newsgroup. Am I allowed to
post code and ask for help? I hope so.. :)

Here's my problem: I am trying problem 127 of the valladolid online
contests (http://online-judge.uva.es/p/v1/127.html). The program I wrote
seems to work fine, but it takes way too much memory to run. I am not that
good at programming C++, unfortunately, so I can't seem to find my memory
leak. As far as I can tell, I am deallocating every bit of memory I am
allocating. If someone can skim through my code to help I'd be forever
grateful. It is not that long....

I think I am doing everything correctly.

Thanks to anyone who can help!!

CODE:
#include <iostream>

// Pile class .. simple STACK implementation
class Pile {
private:
int ncards;
char **cards; // array of pointers

public:
Pile() {
ncards = 0;
cards = new char * [52]; // allocate space for 52 pointers
}

~Pile() {
// deallocate all cards in pile
for(int i = 0; i < ncards; i++) delete [] cards[i];
delete [] cards; // deallocate pointers
}

void push(char *card) {
// create a new char array & copy values
cards[ncards] = new char [2];
cards[ncards][0] = card[0];
cards[ncards][1] = card[1];
ncards++;
}

void pop() {
if(ncards > 0) {
delete [] cards[ncards-1]; // deallocate top card
ncards--;
}
}

char* top() {
// create a new char array, copy values and return it
char *p = new char [2];
p[0] = cards[ncards-1][0];
p[1] = cards[ncards-1][1];
return p;
}

bool isEmpty()
{return (ncards == 0);}

int size()
{return ncards;}
};

int npiles;
Pile **piles; // array of pointers to piles

inline void remove(int pos) {
Pile *p = piles[pos]; // save pointer
// shuffle remaining piles
for(int i = pos; i < npiles-1; i++) piles[i] = piles[i+1];
delete p; // deallocate empty pile
npiles--;
}

bool makeMove() { // compares cards, moves like cards, deallocates empty
piles
for(int i = 1; i < npiles; i++) {
char *cardA = piles[i]->top();
int diff = (i > 2) ? 3 : 1;
while(diff > 0) {
char *cardB = piles[i-diff]->top();
if(cardA[0] == cardB[0] || cardA[1] == cardB[1]) {
piles[i-diff]->push(cardA);
piles[i]->pop();
if(piles[i]->isEmpty()) remove(i);
return true;
}
diff -= 2;
}
}
return false;
}

using namespace std;

int main() {
char card[2];
while(cin >> card) {
if(card[0] == '#') return 0;

npiles = 0;
piles = new Pile * [52]; // allocate space for 52 pointers
for(int i = 0; i < 52; i++) piles[i] = new Pile(); // allocate 52
piles

piles[npiles++]->push(card);

for(int i = 1; i < 52; i++) {
cin >> card;
piles[npiles++]->push(card);
}

while(makeMove( ));

cout << npiles << " pile" << (npiles > 1 ? "s" : "") << " remaining:";
for(int i = 0; i < npiles; i++) cout << " " << piles[i]->size();
cout << endl;

// finally deallocate all piles, as well as pointers to them.
for(int i = 0; i < npiles; i++) delete piles[i];
delete [] piles;
}

return 0;
}

SAMPLE INPUT:
QD AD 8H 5S 3H 5H TC 4D JH KS 6H 8S JS AC AS 8D 2H QS TS 3S AH 4H TH TD 3C
6S
8C 7D 4C 4S 7S 9H 7C 5D 2S KD 2D QH JD 6D 9D JC 2C KH 3D QC 6C 9S KC 7H 9C
5C
AC 2C 3C 4C 5C 6C 7C 8C 9C TC JC QC KC AD 2D 3D 4D 5D 6D 7D 8D TD 9D JD QD
KD
AH 2H 3H 4H 5H 6H 7H 8H 9H KH 6S QH TH AS 2S 3S 4S 5S JH 7S 8S 9S TS JS QS
KS
#
Jul 19 '05 #1
4 3850

"Greg Baker" <gb****@roadrun ner.nf.net.STOP SPAM> wrote in message
news:bj******** **@nntp-stjh-01-01.rogers.nf.ne t...
I don't know what standard protocol is in this newsgroup. Am I allowed to
post code and ask for help? I hope so.. :)

Here's my problem: I am trying problem 127 of the valladolid online
contests (http://online-judge.uva.es/p/v1/127.html). The program I wrote
seems to work fine, but it takes way too much memory to run. I am not that good at programming C++, unfortunately, so I can't seem to find my memory
leak. As far as I can tell, I am deallocating every bit of memory I am
allocating. If someone can skim through my code to help I'd be forever
grateful. It is not that long....

I think I am doing everything correctly.

Thanks to anyone who can help!!

CODE:
#include <iostream>

// Pile class .. simple STACK implementation
class Pile {
private:
int ncards;
char **cards; // array of pointers

public:
Pile() {
ncards = 0;
cards = new char * [52]; // allocate space for 52 pointers
}

~Pile() {
// deallocate all cards in pile
for(int i = 0; i < ncards; i++) delete [] cards[i];
delete [] cards; // deallocate pointers
}

void push(char *card) {
// create a new char array & copy values
cards[ncards] = new char [2];
cards[ncards][0] = card[0];
cards[ncards][1] = card[1];
ncards++;
}

void pop() {
if(ncards > 0) {
delete [] cards[ncards-1]; // deallocate top card
ncards--;
}
}

char* top() {
// create a new char array, copy values and return it
char *p = new char [2];
p[0] = cards[ncards-1][0];
p[1] = cards[ncards-1][1];
return p;
}

bool isEmpty()
{return (ncards == 0);}

int size()
{return ncards;}
};

int npiles;
Pile **piles; // array of pointers to piles

inline void remove(int pos) {
Pile *p = piles[pos]; // save pointer
// shuffle remaining piles
for(int i = pos; i < npiles-1; i++) piles[i] = piles[i+1];
delete p; // deallocate empty pile
npiles--;
}

bool makeMove() { // compares cards, moves like cards, deallocates empty
piles
for(int i = 1; i < npiles; i++) {
char *cardA = piles[i]->top();
int diff = (i > 2) ? 3 : 1;
while(diff > 0) {
char *cardB = piles[i-diff]->top();
if(cardA[0] == cardB[0] || cardA[1] == cardB[1]) {
piles[i-diff]->push(cardA);
piles[i]->pop();
if(piles[i]->isEmpty()) remove(i);
return true;
}
diff -= 2;
}
}
return false;
}

using namespace std;

int main() {
char card[2];
while(cin >> card) {
if(card[0] == '#') return 0;

npiles = 0;
piles = new Pile * [52]; // allocate space for 52 pointers
for(int i = 0; i < 52; i++) piles[i] = new Pile(); // allocate 52
piles

piles[npiles++]->push(card);

for(int i = 1; i < 52; i++) {
cin >> card;
piles[npiles++]->push(card);
}

while(makeMove( ));

cout << npiles << " pile" << (npiles > 1 ? "s" : "") << " remaining:"; for(int i = 0; i < npiles; i++) cout << " " << piles[i]->size();
cout << endl;

// finally deallocate all piles, as well as pointers to them.
for(int i = 0; i < npiles; i++) delete piles[i];
delete [] piles;
}

return 0;
}

SAMPLE INPUT:
QD AD 8H 5S 3H 5H TC 4D JH KS 6H 8S JS AC AS 8D 2H QS TS 3S AH 4H TH TD 3C
6S
8C 7D 4C 4S 7S 9H 7C 5D 2S KD 2D QH JD 6D 9D JC 2C KH 3D QC 6C 9S KC 7H 9C
5C
AC 2C 3C 4C 5C 6C 7C 8C 9C TC JC QC KC AD 2D 3D 4D 5D 6D 7D 8D TD 9D JD QD
KD
AH 2H 3H 4H 5H 6H 7H 8H 9H KH 6S QH TH AS 2S 3S 4S 5S JH 7S 8S 9S TS JS QS
KS
#


Well you call top at least twice without freeing the memory returned.

There is also far to much memory allocation in this code. Allocating fixed
size chars arrays is not a good use of dynamic memory allocation especially
when the fixed size is only 2!

john
Jul 19 '05 #2
Hi John. Thanks for your reply. I actually completed the problem using
static memory.. However, my misunderstandin g of dynamic memory wants me to
figure this out.

I fixed the __top__ problem, and it cut my memory consumption by a lot...
Stupid me...

Thanks again!

"John Harrison" <jo************ *@hotmail.com> wrote in message
news:bj******** ****@ID-196037.news.uni-berlin.de...

"Greg Baker" <gb****@roadrun ner.nf.net.STOP SPAM> wrote in message
news:bj******** **@nntp-stjh-01-01.rogers.nf.ne t...
I don't know what standard protocol is in this newsgroup. Am I allowed to post code and ask for help? I hope so.. :)

Here's my problem: I am trying problem 127 of the valladolid online
contests (http://online-judge.uva.es/p/v1/127.html). The program I wrote seems to work fine, but it takes way too much memory to run. I am not that
good at programming C++, unfortunately, so I can't seem to find my memory leak. As far as I can tell, I am deallocating every bit of memory I am
allocating. If someone can skim through my code to help I'd be forever
grateful. It is not that long....

I think I am doing everything correctly.

Thanks to anyone who can help!!

CODE:
#include <iostream>

// Pile class .. simple STACK implementation
class Pile {
private:
int ncards;
char **cards; // array of pointers

public:
Pile() {
ncards = 0;
cards = new char * [52]; // allocate space for 52 pointers
}

~Pile() {
// deallocate all cards in pile
for(int i = 0; i < ncards; i++) delete [] cards[i];
delete [] cards; // deallocate pointers
}

void push(char *card) {
// create a new char array & copy values
cards[ncards] = new char [2];
cards[ncards][0] = card[0];
cards[ncards][1] = card[1];
ncards++;
}

void pop() {
if(ncards > 0) {
delete [] cards[ncards-1]; // deallocate top card
ncards--;
}
}

char* top() {
// create a new char array, copy values and return it
char *p = new char [2];
p[0] = cards[ncards-1][0];
p[1] = cards[ncards-1][1];
return p;
}

bool isEmpty()
{return (ncards == 0);}

int size()
{return ncards;}
};

int npiles;
Pile **piles; // array of pointers to piles

inline void remove(int pos) {
Pile *p = piles[pos]; // save pointer
// shuffle remaining piles
for(int i = pos; i < npiles-1; i++) piles[i] = piles[i+1];
delete p; // deallocate empty pile
npiles--;
}

bool makeMove() { // compares cards, moves like cards, deallocates empty
piles
for(int i = 1; i < npiles; i++) {
char *cardA = piles[i]->top();
int diff = (i > 2) ? 3 : 1;
while(diff > 0) {
char *cardB = piles[i-diff]->top();
if(cardA[0] == cardB[0] || cardA[1] == cardB[1]) {
piles[i-diff]->push(cardA);
piles[i]->pop();
if(piles[i]->isEmpty()) remove(i);
return true;
}
diff -= 2;
}
}
return false;
}

using namespace std;

int main() {
char card[2];
while(cin >> card) {
if(card[0] == '#') return 0;

npiles = 0;
piles = new Pile * [52]; // allocate space for 52 pointers
for(int i = 0; i < 52; i++) piles[i] = new Pile(); // allocate 52
piles

piles[npiles++]->push(card);

for(int i = 1; i < 52; i++) {
cin >> card;
piles[npiles++]->push(card);
}

while(makeMove( ));

cout << npiles << " pile" << (npiles > 1 ? "s" : "") << "

remaining:";
for(int i = 0; i < npiles; i++) cout << " " << piles[i]->size();
cout << endl;

// finally deallocate all piles, as well as pointers to them.
for(int i = 0; i < npiles; i++) delete piles[i];
delete [] piles;
}

return 0;
}

SAMPLE INPUT:
QD AD 8H 5S 3H 5H TC 4D JH KS 6H 8S JS AC AS 8D 2H QS TS 3S AH 4H TH TD 3C 6S
8C 7D 4C 4S 7S 9H 7C 5D 2S KD 2D QH JD 6D 9D JC 2C KH 3D QC 6C 9S KC 7H 9C 5C
AC 2C 3C 4C 5C 6C 7C 8C 9C TC JC QC KC AD 2D 3D 4D 5D 6D 7D 8D TD 9D JD QD KD
AH 2H 3H 4H 5H 6H 7H 8H 9H KH 6S QH TH AS 2S 3S 4S 5S JH 7S 8S 9S TS JS QS KS
#


Well you call top at least twice without freeing the memory returned.

There is also far to much memory allocation in this code. Allocating fixed
size chars arrays is not a good use of dynamic memory allocation

especially when the fixed size is only 2!

john

Jul 19 '05 #3
Greg Baker <gb****@roadrun ner.nf.net.STOP SPAM> wrote in message
news:bj******** **@nntp-stjh-01-01.rogers.nf.ne t...
Hi John. Thanks for your reply. I actually completed the problem using
static memory..


Well, I hope that doesn't become a habit. Static data, unless it is const,
is usually a bad idea. Static variables are wasteful of memory, make any
code that uses them non-re-entrant, and tie the code down to specific
variables instead of any of your choice. Nothing in your program calls for
any static variables, including the static variables you already had
('npiles' and 'piles'). Maybe for your particular purpose it doesn't matter,
but in normal circumstances a programmer would be willing to do just about
anything before declaring a variable static.

DW

Jul 19 '05 #4


Greg Baker wrote:

I don't know what standard protocol is in this newsgroup. Am I allowed to
post code and ask for help? I hope so.. :)

Here's my problem: I am trying problem 127 of the valladolid online
contests (http://online-judge.uva.es/p/v1/127.html). The program I wrote
seems to work fine, but it takes way too much memory to run. I am not that
good at programming C++, unfortunately, so I can't seem to find my memory
leak. As far as I can tell, I am deallocating every bit of memory I am
allocating. If someone can skim through my code to help I'd be forever
grateful. It is not that long....
The most important thing is:
don't do the allocations by yourself.
In your class it seems you want an array of strings.
So start with

std::vector< std::string > cards;

and the vector and the string will manage all the memory by themselfs :-)

But on to your actual program.

I think I am doing everything correctly.

Thanks to anyone who can help!!

CODE:
#include <iostream>

// Pile class .. simple STACK implementation
class Pile {
private:
int ncards;
char **cards; // array of pointers

public:
Pile() {
ncards = 0;
cards = new char * [52]; // allocate space for 52 pointers
Note: all those pointers have undefined values. They point anywhere.
So you have to assign some values to them:

for( int i = 0; i < 52; ++i )
cards[i] = NULL;
}

~Pile() {
// deallocate all cards in pile
for(int i = 0; i < ncards; i++) delete [] cards[i];
This will only work, if the pointers point somewhere or are NULL.
So the assignment in the constructor is crucial for this to work.
delete [] cards; // deallocate pointers
}

void push(char *card) {
// create a new char array & copy values
cards[ncards] = new char [2];
cards[ncards][0] = card[0];
cards[ncards][1] = card[1];
That's not a good idea. let push figure out the length of the passed
string and deal with that instead of assuming it has a length of 2.

int len = strlen( card );
cards[ncards] = new char [ len + 1 ];
strcpy( cards[ncards], card );
ncards++;
}

void pop() {
if(ncards > 0) {
delete [] cards[ncards-1]; // deallocate top card
It's a good idea to immediatly reset cards[ncards-1] to NULL
right now.
Otherwise the destructor of this class will try to delete the
very same memory again.

cards[ncards-1] = NULL;
ncards--;
}
}

char* top() {
// create a new char array, copy values and return it
char *p = new char [2];
p[0] = cards[ncards-1][0];
p[1] = cards[ncards-1][1];
Again: Don't assume 2 characters are sufficient. Allocate as much as you need:

char* p = new char [ strlen( cards[ncards-1] ) + 1 ];
strcpy( p, cards[ ncards-1] );
return p;
}

bool isEmpty()
{return (ncards == 0);}

int size()
{return ncards;}
};

int npiles;
Pile **piles; // array of pointers to piles

inline void remove(int pos) {
Pile *p = piles[pos]; // save pointer
// shuffle remaining piles
for(int i = pos; i < npiles-1; i++) piles[i] = piles[i+1];
delete p; // deallocate empty pile
npiles--;
}

bool makeMove() { // compares cards, moves like cards, deallocates empty
piles
for(int i = 1; i < npiles; i++) {
char *cardA = piles[i]->top();
int diff = (i > 2) ? 3 : 1;
while(diff > 0) {
char *cardB = piles[i-diff]->top();
if(cardA[0] == cardB[0] || cardA[1] == cardB[1]) {
piles[i-diff]->push(cardA);
piles[i]->pop();
if(piles[i]->isEmpty()) remove(i);
return true;
}
diff -= 2;
}
}
remember what top() did?
It allocated a new character array and returned that.
But I can't see you deleteing it somewhere in this function.
return false;
}

using namespace std;

int main() {
char card[2];
while(cin >> card) {
Oha. Looking at the input file, I can see that you intend
to store 2 characters in card. cin >> card will store them as
C style string, meaning: you will need an array size of 3 for storing
this string. Remember: a C-style string is allways terminated with
a '\0' character!

if(card[0] == '#') return 0;

npiles = 0;
piles = new Pile * [52]; // allocate space for 52 pointers
for(int i = 0; i < 52; i++) piles[i] = new Pile(); // allocate 52
piles
May I suggest you drop the habit of writing the decendent line
on the same line even if it's only a single statement ...

for( int i = 0; i < 52; i++ )
piles[i] = new Pile;

.... It's much easier to see what is controlled by the for loop.

piles[npiles++]->push(card);

for(int i = 1; i < 52; i++) {
cin >> card;
piles[npiles++]->push(card);
}

while(makeMove( ));
Same here. It often happens that somebody writes the above by accident.
To make it clear that your intent *is* an empty loop body, write:

while( makeMove() )
;

cout << npiles << " pile" << (npiles > 1 ? "s" : "") << " remaining:";
for(int i = 0; i < npiles; i++) cout << " " << piles[i]->size();
cout << endl;

// finally deallocate all piles, as well as pointers to them.
for(int i = 0; i < npiles; i++) delete piles[i];
delete [] piles;
}

return 0;
}


Also note: you class Pile is in need for a copy constructor and an assignment
operator. Read up on the 'rule of three' to learn why.
Even if you don't know what all this things do, you should make it a habit
to at least declare them private and don't implement them. Then the compiler
and/or linker will warn you when they are used by accident:

class Pile {
private:
int ncards;
char **cards; // array of pointers

Pile( const Pile& Arg ); // not implemented by intention
Pile& operator=( const Pile& Arg ); // not implemented by intention

public:
Pile() {
ncards = 0;
cards = new char * [52]; // al

...

--
Karl Heinz Buchegger, GASCAD GmbH
Teichstrasse 2
A-4595 Waldneukirchen
Tel ++43/7258/7545-0 Fax ++43/7258/7545-99
email: kb******@gascad .at Web: www.gascad.com

Fuer sehr grosse Werte von 2 gilt: 2 + 2 = 5
Jul 19 '05 #5

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

8
3412
by: ranjeet.gupta | last post by:
Dear All Is the Root Cause of the Memory corruption is the Memory leak, ?? suppose If in the code there is Memory leak, Do this may lead to the Memory Corruption while executing the program ? In nut shell, what is/are the realtion/s between the Memory Leak and Memory Corruption. Juts Theoritical Assumtion below:
17
4809
by: José Joye | last post by:
Hi, I have implemented a Service that is responsible for getting messages from a MS MQ located on a remote machine. I'm getting memory leak from time to time (???). In some situation, it is easier to reproduce (e.g.: remote machine not available). After about 1 day, I get a usage of 300MB of memory. I have used .NET Memory Profiler tool to try to see where the leak is located. For all the leaky instances, I can see the following (I...
6
1866
by: Christopher C | last post by:
I am currently working on an app the will be a shell replacement. Part of the goal is to list the current network status; basically I need to know if the network card is plugged in. I am currently using WMI to query all adapters to see if they have a connected status. The status is updated every 30minutes. I noticed this is leaking memory. I am looking for suggestions. I am running this on an asynchronous thread call with callbacks to a...
23
4555
by: James | last post by:
The following code will create memory leaks!!! using System; using System.Diagnostics; using System.Data; using System.Data.SqlClient; namespace MemoryLeak
7
5107
by: david wolf | last post by:
I have a problem that is used to test memory leak as follows, however, after each run of the program, if I am using the command "free" on the linux box, I did not see any difference about the usable memory. My questions are: 1) How to find out exact free memory that my program can use? 2) Use which command to do this (top, or free) 3) why it does not show memory leak in my case (I am using the linux command free) ...
1
2976
by: Dante | last post by:
I have encountered a memory leak in out application using .NET 2.0 while using our owner drawn controls. There are two instances I have found when checking the memory using .NET Memory Profiler from SciTech, both led to WeakReference leaks: Graphics.DrawIconUnstretched() the call stack is as follows: Icon.DrawUnstretched(...); WindowsGraphics.FromGraphics WindowsGraphics.FromHdc();
0
1209
by: hairobinson | last post by:
Can any one help me explaing about Kernel Memory leak? what is kernel memory leak? how do we debug Kernel level Memory Leak? Do we have standard tool for finding it? How do we differentiate Kernel level memory leak with Application level Memory leak? Thanks in Advance,
4
184
by: Christian Heimes | last post by:
Gabriel Genellina schrieb: Pure Python code can cause memory leaks. No, that's not a bug in the interpreter but the fault of the developer. For example code that messes around with stack frames and exception object can cause nasty reference leaks. Christian
22
9345
by: Peter | last post by:
I am using VS2008. I have a Windows Service application which creates Crystal Reports. This is a multi theaded application which can run several reports at one time. My problem - there is a memory leak someplace. I can not detect the memory leak by running several reports by hand, but when I run tha app as a servrice and process few hundred reports there is significant memory leak. The application can consume over 1GB of memory where it...
0
8736
by: Hystou | last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it. First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
0
9227
jinu1996
by: jinu1996 | last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that captivates audiences and drives business growth. The Art of Business Website Design Your website is...
1
9138
by: Hystou | last post by:
Overview: Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows Update option using the Control Panel or Settings app; it automatically checks for updates and installs any it finds, whether you like it or not. For most users, this new feature is actually very convenient. If you want to control the update process,...
0
8016
agi2029
by: agi2029 | last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing, and deployment—without human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then launch it, all on its own.... Now, this would greatly impact the work of software developers. The idea...
1
6676
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules. He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms. Adolph will...
0
5992
by: conductexam | last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one. At the time of converting from word file to html my equations which are in the word document file was convert into image. Globals.ThisAddIn.Application.ActiveDocument.Select();...
0
4761
by: adsilva | last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
1
3201
by: 6302768590 | last post by:
Hai team i want code for transfer the data from one system to another through IP address by using C# our system has to for every 5mins then we have to update the data what the data is updated we have to send another system
3
2137
bsmnconsultancy
by: bsmnconsultancy | last post by:
In today's digital era, a well-designed website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating effective websites that not only look great but also perform exceptionally well. In this comprehensive...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.