TheGameCreators - CodeBase - Simple Array Sorting Using Native Code: Compression

Category: Core

Version: 1.0

Information

Uploaded: 9th Nov 2012 05:17

Modified: 10th Nov 2012 04:15

Author: nonZero

Summary

Quick sort method for shifting data in arrays to group items together and place blank elements (indices) outside. This is NOT for deleting array elements.

Full Description

See short description and code.

DarkBASIC Professional Source Code

` This code was downloaded from The Game Creators

` It is reproduced here with full permission

` http://www.thegamecreators.com

////////////////////////////////////////////////////////////////

// Simple Array Sorting Using Native Code: Compression        //

////////////////////////////////////////////////////////////////

// * This is free to use, however you see fit.                //

// * I accept no liability for loss or damages related to the //

//   use of this code.                                        //

// * I provide no warranty or guarantee of any sort regarding //

//   the code.                                                //

// * A credit to the author is not required, but it is always //

//   appreciated.                                             //

// * Make derivs and improvements on this code as much as you //

//   like but please don't just copy-paste it and claim it as //

//   your own. How will you face your ancestors then?         //

// * THE FORMATTING MAY BE OFF due to the codebase's limited  //

//   number of columns and enforced word-wrapping. As such,   //

//   it is recomended you copy and paste it to your editor    //

//   to view it properly. Notepad will even be sufficient.    //

//                                                            //

// Cheers, nonZero                                            //

////////////////////////////////////////////////////////////////

``` In this scenario, we'll apply the array shifting to an inventory-system. One of the worst bugs

``` in many retro-games and even modern home-brew games was having an inventory that didn't compress

``` itself, eg: [Sword], [], [Milk], [Axe], [], [], [Boots]

// Create an array

DIM inven(4)

// Make whichever slots you like 0 or other numbers and then print output

inven(0) = 0

inven(1) = 2

inven(2) = 1

inven(3) = 1

inven(4) = 0

PRINT: PRINT "Current Inventory:": FOR i = 0 TO 4: PRINT "inven"; "("; i; "): "; inven(i): NEXT i

// The important bit where it all happens

maxSlots = ARRAY COUNT(inven())

DEC maxSlots                                 // Decrease maxSlots for the following operation (must iterate for 0 to 3 (4cycles)

FOR b = 0 TO maxSlots

FOR a = 0 TO maxSlots                  // We scan every slot per slot. This is the easiest way.

IF inven(a) = 0                  // We only do the shift if our present slot is empty, therefore it's always safe

inven(a) = inven(a+1)      // Here's why we did 0 to 3 earlier: We're refencing inven(a+1) on the last iteration

inven(a+1) = 0             // which is inven(4). This prevents buffer overflow.

ENDIF

NEXT a

NEXT b

// Print the results after shift

PRINT: PRINT "Post-shift Inventory:": FOR i = 0 TO 4: PRINT "inven"; "("; i; "): "; inven(i): NEXT i

CodeBase - Simple Array Sorting Using Native Code: Compression

Information

Summary

Full Description

DarkBASIC Professional Source Code

Download

Screen Shot

Author

Comments

Author Name:	nonZero
CodeBase Entries:	4