<div>
If i read in a list of numbers i would usually do this<br />
<br />
static int[] array = new int[10];<br />
<br />
for(int i=0; i&lt;split.Length; i++)<br />
{<br />
&nbsp; &nbsp; &nbsp; &nbsp;array[i] = int.Parse(split[i]);<br />
}<br />
<br />
ok so thats going to put them in the array. &nbsp;Now when i go to sort that array using a bubble sort if the numbers which were read in didn't fill the whole array i get &quot;0&quot; when i sort it and it messes the sort up.
</div>


If i read in a list of numbers i would usually do this

static int[] array = new int[10];

for(int i=0; i<split.Length; i++)
{
       array[i] = int.Parse(split[i]);
}

ok so thats going to put them in the array.  Now when i go to sort that array using a bubble sort if the numbers which were read in didn't fill the whole array i get "0" when i sort it and it messes the sort up.

<div>
<div class="content wysiwyg-content">
If i want to fill an array with numbers, but im not sure what the size is until i run the program how do i make an array adjustable? &nbsp;I assume you would need to put it in some kind of for loop,
</div>
</div>


If i want to fill an array with numbers, but im not sure what the size is until i run the program how do i make an array adjustable?  I assume you would need to put it in some kind of for loop,

Arrays C#

Programming includes both the specifics of the language you’re using, like Visual Basic, .NET, Java and others, but also the best practices in user experience and interfaces and the management of projects, version control and development. Other programming topics are related to web and cloud development and system and hardware programming.

Programming

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.