Can't understand authors description related to Insertion Sort
Can someone explain me the points circled in red? I am really confused and don't really get why did the author say so, flag is denoted by f in the book
I'm not sure why the article calls "f" a flag, as it's just an index. The function f(...) is supposed to count how many times "f" gets updated (f = k), to "find" the smallest element, which I assume means to swap the smallest element to a[1]. In this case the smallest element has a value of 1. If a[n] == 1, then "f" will get updated to "n" and a swap for a[1] <=> a[n] occurs. If a[n] != 1, then "f" may get updated, but not because a[n] is the smallest element in the group (the smallest element has a value of 1), so it's not counted by the function f(...). I understand the definition of f(), but I don't understand the point for defining f(...) in that manner.
- Math.Sin() gives incorrect value
- How to run my python script when the sunOS is start booting
- Express-session: not resetting cookie expiration on each request
- Getting a stack overflow exception when normalizing a vector
- Edit default summary function in R gives error for multiple variables
- What was a For loop? Why isn't it needed in R?
- How to use download button in shiny and save results in various formats (csv, texte, pdf, spss...)?
- Why are there two assignment operators, `<-` and `->` in R?
- lm()$assign: what is it?
- How to get the value of list(...) in R and S functions
- Design matrix for MLM from library(lme4) with fixed and random effects
- how to generate elements not included in my sample
- Create a matrix with gradually changing values without a for loop
- Emacs ESS and S-plus ( S+ ) 8.1 compatability
- How to lag date-index in a time-series in R?
- Nonlinear regression in R / S
- Calling R from S-Plus?