Carey Lin
Scratch專案展示(排序法及搜尋法)
Try
HackMD
Carey Lin
·
Follow
Last edited by
Carey Lin
on
May 6, 2025
Linked with GitHub
Contributed by
1
0
Comments
Feedback
Log in to edit or delete your comments and be notified of replies.
Sign up
Already have an account? Log in
There is no comment
Select some text and then click Comment, or simply add a comment to this page from below to start a discussion.
Discard
Send
tags: Scratch教學
Scratch專案展示(排序法與搜尋法)
Image Not Showing
Possible Reasons
The image file may be corrupted
The server hosting the image is unavailable
The image path is incorrect
The image format is not supported
Learn More →
Scratch 氣泡排序法
Image Not Showing
Possible Reasons
The image file may be corrupted
The server hosting the image is unavailable
The image path is incorrect
The image format is not supported
Learn More →
教學網站連結
Image Not Showing
Possible Reasons
The image file may be corrupted
The server hosting the image is unavailable
The image path is incorrect
The image format is not supported
Learn More →
Scratch 循序搜尋法(線性搜尋法)
[
Image Not Showing
Possible Reasons
The image file may be corrupted
The server hosting the image is unavailable
The image path is incorrect
The image format is not supported
Learn More →
教學網站連結](
基本演算法 - 循序搜尋法程式設計(Scrach)
程式說明: 隨機產生50個1~100的數字,並放入”原始資料”清單。 詢問並請使用者輸入1~100的數字。 將輸入的數字與原始清單從第1個開始做比對,直到數字相同或比對的位置超過50,過程中會顯示原始清單比對的數字。 如果位置超過50顯示”沒有找到符合的數字”,否則顯示找到的位置。
https://sites.google.com/go.edu.tw/algorithm/%E6%90%9C%E5%B0%8B%E6%BC%94%E7%AE%97%E6%B3%95/%E5%BE%AA%E5%BA%8F%E6%90%9C%E5%B0%8B%E6%B3%95%E7%A8%8B%E5%BC%8F%E8%A8%AD%E8%A8%88scrach?authuser=0
)
Image Not Showing
Possible Reasons
The image file may be corrupted
The server hosting the image is unavailable
The image path is incorrect
The image format is not supported
Learn More →
Scratch 二元搜尋法(二分搜尋法)
[
Image Not Showing
Possible Reasons
The image file may be corrupted
The server hosting the image is unavailable
The image path is incorrect
The image format is not supported
Learn More →
教學網站連結](
基本演算法 - 二元搜尋法程式設計(Scratch)
程式說明: 隨機產生6個數字,並依大小放入”資料清單”。(簡化版:不做排序程式) 詢問並請使用者輸入的數字。 每一輪找出最大值與最小值的中間值位置,然後比對中間值位置的數字是否與要搜尋的數字相符 若相符則比對結束(找到資料),若無則將中間值位置之數字與另一側的數字資料排除。 如果位置超過6顯示”此數不存在”,否則顯示找到的位置。
https://sites.google.com/go.edu.tw/algorithm/%E6%90%9C%E5%B0%8B%E6%BC%94%E7%AE%97%E6%B3%95/%E4%BA%8C%E5%85%83%E6%90%9C%E5%B0%8B%E6%B3%95%E7%A8%8B%E5%BC%8F%E8%A8%AD%E8%A8%88scratch
)
1
Scratch專案展示(排序法與搜尋法)
Scratch 氣泡排序法
Scratch 循序搜尋法(線性搜尋法)
Scratch 二元搜尋法(二分搜尋法)
Expand all
Back to top
Go to bottom
Scratch專案展示(排序法與搜尋法)
Scratch 氣泡排序法
Scratch 循序搜尋法(線性搜尋法)
Scratch 二元搜尋法(二分搜尋法)
Expand all
Back to top
Go to bottom
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up
Comment