From mboxrd@z Thu Jan  1 00:00:00 1970
From: "Chris" <nanakos@wired-net.gr>
Subject: Array Empty Slots
Date: Mon, 4 Apr 2005 17:32:40 +0300
Message-ID: <001301c53923$2804a9c0$0101010a@dioxide>
References: <Pine.LNX.4.58.0503221104060.30671@ns.isi.ulatina.ac.cr> <200503221305.32606.eric@cisu.net> <Pine.LNX.4.58.0503221215250.31636@ns.isi.ulatina.ac.cr>
Mime-Version: 1.0
Content-Transfer-Encoding: 7bit
Return-path: <linux-c-programming-owner@vger.kernel.org>
Sender: linux-c-programming-owner@vger.kernel.org
List-Id: <linux-c-programming.vger.kernel.org>
Content-Type: text/plain; charset="us-ascii"
To: linux-c-programming@vger.kernel.org

Hi all,
Lets assume we have a very very big array with sequential integer numbers
from 1-30000, but we have some slots that are empty.
Which is the faster way(algorithm maybe) that we can track those empty
slots???


Best regards,
Chris.