Reputation: 0 Apprentice
- Active Posts:
- 27 (0.05 per day)
- 07-November 11
- Profile Views:
- Last Active:
- Jan 30 2013 12:25 AM
- Dream Kudos:
Posts I've Made
Posted 30 Oct 2012Additional thoughts for you:
1. Have you considered what server to use? Your J2EE project will not run without a server you know.
2. Are you considering buying for proprietary software to run this thing(database, libraries) or are you planning to go the freeware way?
3. I'm sure there'll be some reports generation that will happen on your system. Have you decided what reports library to use?
4. Last of all, I'm just throwing this out there, but look into using frameworks like Spring and Hibernate. You can add this to your experience.
Greatly informative reply .
1. Well most probably gonna use tomcat apache or apache server
2. The database is gonna be sql server (We are getting it for free as i am a student ) or mysql
I have another question : a friend if mine said that if we have to deploy it on a LAN , how about making the web app using php and mysql as it will take less time. Thought??
Posted 13 Oct 2012Since I'm not quite convinced 10^6 elements should be creating a seg fault, I'm going to assume that (1) you're using Visual C++ which has a default stack size of 1MB or (2) you've got a programming error. You're using conio.h, so I know you're on a Windows machine. As a workaround you can create the array on the heap. As good practice, you shouldn't create large objects on the stack.
Creating the array on the heap solved the problem . Thanks
Posted 13 Oct 2012I tried to run my program with
unsigned int max_size = 1000000(which is the array index) and I am getting a segmentation fault in my program(i think) (the problem remains even if i use
so is there something wrong with my implementation?? I am only able to run upto a max array size of 100000 (which takes 47 ms to sort)
Posted 12 Oct 2012For a sort algorithm you could give it a million-entry array of random numbers and have it sort the array, then run through the resulting array and ensure that all elements are greater than or equal to the previous element. That will allow you to check the array was properly sorted in linear time. Then you could put this all in a loop and time it (using time, or another library -- likely OS-dependent) then take the average of say 100 or 1000 million-item arrays being sorted and/ or checked to see about how long it takes to sort your arrays.
Thanks a lot for the help.. It definitely made sense.
Anyway i have just one more question..How do I time my code using a library (I know its a stupid question but please bear with me) .. Do you have a sample code or tutorial for it?? or any resource that I can look into for that... i want to test my code manually before using a testing tool ..thanks
Posted 29 Aug 2012No i dont think the quality is bad for my purpose. But is there any way to increase quality using the same random number generator (rand()) in general ?
- Member Title:
- New D.I.C Head
- Age Unknown
- Birthday Unknown
- Click here to e-mail me
sumi1234 hasn't added any friends yet.