mirror of
https://github.com/krahets/hello-algo.git
synced 2026-02-08 05:14:16 +08:00
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
50 lines
1.5 KiB
C#
50 lines
1.5 KiB
C#
/**
|
|
* File: linear_search.cs
|
|
* Created Time: 2022-12-23
|
|
* Author: haptear (haptear@hotmail.com)
|
|
*/
|
|
|
|
namespace hello_algo.chapter_searching;
|
|
|
|
public class linear_search {
|
|
/* Linear search (array) */
|
|
int LinearSearchArray(int[] nums, int target) {
|
|
// Traverse array
|
|
for (int i = 0; i < nums.Length; i++) {
|
|
// Found the target element, return its index
|
|
if (nums[i] == target)
|
|
return i;
|
|
}
|
|
// Target element not found, return -1
|
|
return -1;
|
|
}
|
|
|
|
/* Linear search (linked list) */
|
|
ListNode? LinearSearchLinkedList(ListNode? head, int target) {
|
|
// Traverse the linked list
|
|
while (head != null) {
|
|
// Found the target node, return it
|
|
if (head.val == target)
|
|
return head;
|
|
head = head.next;
|
|
}
|
|
// Target node not found, return null
|
|
return null;
|
|
}
|
|
|
|
[Test]
|
|
public void Test() {
|
|
int target = 3;
|
|
|
|
/* Perform linear search in array */
|
|
int[] nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
|
|
int index = LinearSearchArray(nums, target);
|
|
Console.WriteLine("Index of target element 3 = " + index);
|
|
|
|
/* Perform linear search in linked list */
|
|
ListNode? head = ListNode.ArrToLinkedList(nums);
|
|
ListNode? node = LinearSearchLinkedList(head, target);
|
|
Console.WriteLine("Node object corresponding to target node value 3 is " + node);
|
|
}
|
|
}
|