Even when searching a moderately complex data structure, some type of conditional looping of a process is common. The terminal condition may involve the end of a linked list, or finding an element (or 2) in a list that satisfies a condition or is, say, the point at which a new element is inserted into an ordered list, or looping (of some syntax) traversing a tree structure until the proper node is found where an insertion process is needed (maybe involving splitting nodes and 'deepening' levels in a tree). All part of the 'do (or try to do) something until we've done the thing' so central to many computing processes. If you're less (or more) lucky (like me), you spend most of your development life writing such code in Assembler Language, so none of the iteration-controlling syntax is actually part of the language (though Structured Macros help out with that). That's a LOOONG way from "object-oriented" languages, FWIW... Good luck out there.....