r - Is a While Loop actually appropriate here or have I (once again) misunderstood the apply family of functions? -

I am a new user of R and more programs are used for loops functions with programs like Matab, but RK I am trying to shy away from the extremities in the strength and weaknesses of implementing the tasks. The only problem is that I am not 100% sure when one should go in favor of another, for example:

I have a series in which I want to convert to individual plots. I want to locate these plots at a particular point and then zoom into the area of ​​plot by determining the plot of Xml and Yelim so that the graph will contain only 80 or fewer digits

and now the code For (In German) = Weg = Kraft = Strain, Zeit = Time):

  Data MyData & lt #reads; - read.table (file, header = true, leave = 52, dec = ",") #establishes Are the fields of MyData what are the craft's & lt; - MyData [, 2] weg & lt; - MyData [3] Zeit & lt; - MyData [, 1] #Finds is the distance plot, the area in which I am interested in Weg_Values_at_Fmax & lt am the values ​​associated with maximum force; - weg [Joe (craft == max (craft))] initiates the next set values ​​of # rows, which in that time the loop will change from # to zero, second distance # distance on both sides of the value maximum force Linked with N & lt; - 0 Weg.index & lt; - Joe (weg> = Weg_Values_at_Fmax) - Weg_Values_at_Fmax [Length (Weg_Values_at_Fmax)] * (1/7) + n) & amp; weg & lt; = (Weg_Values_at_Fmax [lengt hour (Weg_Values_at_Fmax)] Weg_Values_at_Fmax [length (Weg_Values_at_Fmax)] * (1/7) - n)) #finally while loop which n until # Weg.index increase falls below a certain value (which Weg.index decreasing), 80 points in the case # While (length (Weg.index)> 80) {n & lt; - n + 0.0005 Weg.index & lt; - (Weg> = Weg_Values_at_Fmax] - Weg_Values_at_Fmax [Length (Weg_Values_at_Fmax)] * (1/6) + n) & amp; weg & lt; = (Weg_Values_at_Fmax [Length (Weg_Values_at_Fmax)] Weg_Values_at_Fmax [length (Weg_Values_at_Fmax)] * (1/6) - N))}  

then comes the notation:

  Plot (VG, Craft, Aksli = C (VG [Vegkindaks [1]], VG [VG. IndiX [length (VG. Indak)]), Yil = C (min (Craft) [Wegkindex [1: length (Wegkindex)] ], This code works fine because there is not too much data (craft [Weg.index [1: length (Weg.index)]])), main = file  

But I am hoping that this kind of data is a better way of handling the request for a while when I need to reduce the large data. I hope this question was quite specific and it is not a subject or anything like that. Thank you for your time and assistance.