Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Fundamentals for Self-Taught Programmers
  • Table Of Contents Toc
Fundamentals for Self-Taught Programmers

Fundamentals for Self-Taught Programmers

By : Greenaway
5 (8)
close
close
Fundamentals for Self-Taught Programmers

Fundamentals for Self-Taught Programmers

5 (8)
By: Greenaway

Overview of this book

Software engineering is a set of techniques, including programming, within the computer science discipline associated with the development of software products. This practical guide to software engineering will enable aspiring and new developers to satisfy their curiosity about the industry and become ready to learn more about the basics before beginning to explore programming languages, along with helping junior and upcoming developers to effectively apply their knowledge in the field. The book begins by providing you with a comprehensive introduction to software engineering, helping you gain a clear, holistic understanding of its various sub-fields. As you advance, you’ll get to grips with the fundamentals of software engineering, such as flow control, data structures and algorithms. The book also introduces you to C# and guides you in writing your first program. The concluding chapters will cover case studies, including people working in the industry in different engineering roles, as well as interview tips and tricks and coding best practices. By the end of this programming book, you'll have gained practical knowledge of the implementation and associated methodologies in programming that will have you up and running and productive in no time.
Table of Contents (20 chapters)
close
close
1
Part 1: Software Engineering Basics
5
Part 2: Introduction to Programming
13
Part 3: Software Engineering – the Profession

Introduction to the linear search algorithm

The linear search algorithm is a basic search within a data structure that begins by visiting the data at the beginning and visits each value until it’s found or reaches the end of the array, where the value does not exist. In the Introduction to the array data structure section, we did a linear search to find a picture in the example array. We’ll experiment with it more by using the same array of integers used in the selection sort algorithm. First, let’s write the algorithm in pseudocode:

  1. Store the value being searched for.
  2. Start at index 0.
  3. WHILE the value is not found and is not at end of the array.
    1. IF the value is equal to the value being searched for.
    1. Return the index
    2. ELSE
    1. Increase the index by 1 and move on to the next value.

    C. IF at end of the array.

    1. Print value not found.

In the following example, we will be searching for the integer 48, so the algorithm will visit the value at index 0:

...
Visually different images
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Fundamentals for Self-Taught Programmers
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon