java prog to sort million input
-
I want a code of java prog which can take million integers as input, sort them (bubble or quick or selection sort). It should display time taken to sort first 10 integer, then for first 100 integer, then for 10000 and total. Please help me soon I have very less time to complete my project. iamsohail.srk@gmail.com
-
I want a code of java prog which can take million integers as input, sort them (bubble or quick or selection sort). It should display time taken to sort first 10 integer, then for first 100 integer, then for 10000 and total. Please help me soon I have very less time to complete my project. iamsohail.srk@gmail.com
You'll have a greater chance of getting an answer if you post in the JAVA forum[^]. And when you do, be sure to say what you've tried and where you're stuck.
Wrong is evil and must be defeated. - Jeff Ello
-
I want a code of java prog which can take million integers as input, sort them (bubble or quick or selection sort). It should display time taken to sort first 10 integer, then for first 100 integer, then for 10000 and total. Please help me soon I have very less time to complete my project. iamsohail.srk@gmail.com
Sohail Sowell wrote:
I want a code of java prog
You can get help if you are stuck with a specific question on writing the code; but if you are looking for someone to do your work, this is the wrong place. Good luck.
Bastard Programmer from Hell :suss: If you can't read my code, try converting it here[^][](X-Clacks-Overhead: GNU Terry Pratchett)
-
I want a code of java prog which can take million integers as input, sort them (bubble or quick or selection sort). It should display time taken to sort first 10 integer, then for first 100 integer, then for 10000 and total. Please help me soon I have very less time to complete my project. iamsohail.srk@gmail.com
Your less time is not a problem for us. We are help to help, not to serve. In Java integers have a limit. You cannot exceed those limits, otherwise you will face a problem known as "Integer Overflow" or "Integer Underflow". It depends on the size of that type, int or long etc. However, there is another special class in Java, BigInteger[^]. You can use it to overcome these limitations in Java. Rest of the stuff are just fancy algorithm based functions. If you are well aware of these functions and algorithms then you can definitely write them yourself. What is so difficult in these problems? Learn more on them, https://en.wikipedia.org/wiki/Bubble_sort[^], https://en.wikipedia.org/wiki/Selection_sort[^], https://en.wikipedia.org/wiki/Quicksort[^]. Then use timer to check how long does it take to complete the task. Simple!
The shit I complain about It's like there ain't a cloud in the sky and it's raining out - Eminem ~! Firewall !~
-
Your less time is not a problem for us. We are help to help, not to serve. In Java integers have a limit. You cannot exceed those limits, otherwise you will face a problem known as "Integer Overflow" or "Integer Underflow". It depends on the size of that type, int or long etc. However, there is another special class in Java, BigInteger[^]. You can use it to overcome these limitations in Java. Rest of the stuff are just fancy algorithm based functions. If you are well aware of these functions and algorithms then you can definitely write them yourself. What is so difficult in these problems? Learn more on them, https://en.wikipedia.org/wiki/Bubble_sort[^], https://en.wikipedia.org/wiki/Selection_sort[^], https://en.wikipedia.org/wiki/Quicksort[^]. Then use timer to check how long does it take to complete the task. Simple!
The shit I complain about It's like there ain't a cloud in the sky and it's raining out - Eminem ~! Firewall !~
Afzaal Ahmad Zeeshan wrote:
Learn more
I think this may be an invalid assumption :laugh:
Never underestimate the power of human stupidity RAH