Link List

dev-C++, Info.Tech, Software Development Comments Off on Link List

Past few weeks, been busy with my online jobs.. yet back to my study in C++, dev-C++. I’m having difficulty on understanding link list coz I’m in the mode of refuse to learn. However, forcing myself will achieve my goal. hehehehe..

Link below is the problem;

  1. Swapping a Link List elements
  2. Search and Delete an elements from Link List

Source Codes:

  1. Swap Link List (743)
  2. Link List Search and Delete (718)

Again, its a rush coding.. its kinda messy.. bwuahahha..

dev-C++: Bank Queue Simulation using Graphic

dev-C++, Info.Tech, Software Development 4 Comments »

Again, I’m not good in C++. Yet I managed to finish my assignment in Advanced Data Structure for MIT. As required, I need to use graphic.h and struct (structure type variables) in dev-C++ to create Bank Queue Simulation.

theBank Sim Screenshot

theBank Sim Screenshot

Here’s the Demo Executable file: theBank Simulation (1086)

Source Code: Bank Queue Simulation Source Code (1251)

Algorithm: Graphic Sort

dev-C++, Info.Tech, Software Development Comments Off on Algorithm: Graphic Sort

Graphic Sort

Graphic Sort

Today, I created different kinds of sorting.

  1. Bubble sort
  2. Selection sort
  3. Insertion sort
  4. Quick sort

Yet, my Quick sort does not work properly… And I have 6 more sorting method to go… 🙁

Download: Graphic Sorting (764) (demo executable file)

Download Source Code: Sorting Source Code (791)

Thanks to: http://www.cs.oswego.edu/~mohammad/classes/csc241/samples/sort/Sort2-E.html

dev-C++ : Bubble Sort with Graphic Plotting

dev-C++, Info.Tech, Software Development Comments Off on dev-C++ : Bubble Sort with Graphic Plotting

I’m having difficulties in creating good programming algorithm with C++. I find its very difficult. Somehow, I would like to share my accomplishment in creating this program, Bubble Sort with Graphic Plotting. But first, what is bubble sort?

Bubble sort is a simple sorting algorithm. It works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements “bubble” to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort.

Below is the demo, source codes and libraries needed…

If you have better algorithm solutions, if you don’t mind, can you email it to me… Like to see how others solve the problem.

WP Theme & Icons by N.Design Studio
Entries RSS Comments RSS Log in