hi. i have to implement a sorting concept.

Could you clarify what you mean by sorting concept, and what language you’re using? Short of a clarification, I think the most common example — in C++ courses, anyway — of sorting is what’s called a "bubble sort." Basically, you use an array of unsorted values. You then iterate that array, checking the values and swapping positions in the array if one value is "greater" than the next. By repeating this process several times, you can effectively, if inefficiently, sort your data. Wikipedia article on bubble sorting: http://dougv.us/nz A tl;dr version with C++ code: http://dougv.us/ny

Ask me anything

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

Current ye@r *